System and method for implementing mesh network communications using a mesh network protocol

ABSTRACT

The following describes data structures, communication protocol formats and process flows for controlling and facilitating secure communications between the nodes of a mesh network, such as utility meters and gateway nodes comprising a utility network. The enabled processes include association, information exchange, route discovery and maintenance and the like for instituting and maintaining a secure mesh network.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims the benefit of U.S. provisional patent application Ser. No. 61/094,116 entitled “Message Formats and Processes for Communication Across a Mesh Network,” filed Sep. 4, 2008 (TR0049-PRO) which is incorporated herein by reference in its entirety.

The present application hereby references and incorporates by reference each of the following United States patent applications:

-   -   Ser. No. 12/275,236 entitled “Point-to-Point Communication         Within a Mesh Network”, filed Nov. 21, 2008 (TR0004-US);     -   Ser. No. 12/275,305 entitled “Transport Layer and Model For an         Advanced Metering Infrastructure (AMI) Network,” filed Nov. 21,         2008 (TR0003-US);     -   Ser. No. 12/275,237 entitled “System and Method For Application         Layer Time Synchronization Without Creating a Time Discrepancy         or Gap in Time”, filed Nov. 21, 2008 (TR0006-US);     -   Ser. No. 12/275,238 entitled “Communication and Message Route         Optimization and Messaging in a Mesh Network,” filed Nov. 21,         2008 (TR0007-US);     -   Ser. No. 12/275,242 entitled “Collector Device and System         Utilizing Standardized Utility Metering Protocol,” filed Nov.         21, 2008 (TR0009-US);     -   Ser. No. 12/275,251 entitled “Power-Conserving Network Device         For Advanced Metering Infrastructure”, filed Nov. 21, 2008         (TR0018-US);     -   Ser. No. 12/275,252 entitled “Method and System For Creating and         Managing Association and Balancing of a Mesh Device in a Mesh         Network”, filed Nov. 21, 2008 (TR0020);     -   Ser. No. 12/275,257 entitled “System and Method for Operating         Mesh Devices in Multi-Tree Overlapping Mesh Networks,” filed         Nov. 21, 2008 (TR0038-US); and     -   Ser. No. 61/094,144 entitled “Framework For Implementing Mesh         Network Layers”, filed Sep. 4, 2008 (TR0052-PRO).

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention pertains generally to a protocol layer for facilitating the creation and maintenance of a secure mesh network. More particularly, preferred embodiments of the invention describe data structures, communication protocol formats and process flows for controlling and facilitating secure communications between the nodes of a mesh network, such as utility meters and gateway devices comprising a utility network.

2. Summary of the Background Art

A mesh network is a wireless network configured to route data between nodes within a network. It allows for continuous connections and reconfigurations around broken or blocked paths by retransmitting messages from node to node until a destination is reached. Mesh networks differ from other networks in that the component parts can all connect to each other via multiple hops. Thus, mesh networks are self-healing: the network remains operational when a node or a connection fails.

Advanced Metering Infrastructure (AMI) or Advanced Metering Management (AMM) are systems that measure, collect and analyze utility usage, from advanced devices such as electricity meters, gas meters, and water meters, through a network on request or a predefined schedule. This infrastructure includes hardware, software, communications, customer associated systems and meter data management software. The infrastructure collects and distributes information to customers, suppliers, utility companies and service providers. This enables these businesses to either participate in, or provide, demand response solutions, products and services. Customers may alter energy usage patterns from normal consumption patterns in response to demand pricing. This improves system load and reliability.

A meter may be installed on a power line, gas line, or water line and wired into a power grid for power. Newly installed meters may associate with a specified network identifier entered by a user during installation. Alternatively, the user may initiate an association window during which a meter may associate with a nearby mesh network.

SUMMARY OF THE INVENTION

In accordance with an embodiment of the present invention, a method of associating a device to a mesh network is described. The method includes selecting a network for association including: requesting, by the device, neighbor information from neighboring devices which may belong to one or more networks, receiving, at the device from one or more neighboring devices, neighbor information for each of the one or more neighboring devices, applying an association ratio algorithm to the received neighbor information to determine which of the one or more networks to select for association. The method further includes selecting a router within the selected network through which to proxy messages by applying a preferred route ratio algorithm; sending a network association request from the device through the router to a network coordinator; and at the network coordinator, performing one of the following in response to the network association request: validating the association request with an association response message which includes the short address for this device, or not responding to the network association request. The method further includes constructing, at the device, an initial neighborhood table.

In accordance with another embodiment of the present invention, a process for routing data frames from a first node to a second node within a network is described. The process includes: a tree routing sub-process, a source routing sub-process, a temporary routing sub-process and a mesh routing sub-process. The particular sub-process for routing a data frame from the first node the second nodes is selected in accordance with the following logic executed on a processor: if the data frame has a source route header the source routing sub-process is selected; if there is an entry for the target address in a temporary routing table, the temporary routing sub-process is selected; if the second node is a coordinator node, the tree routing sub-process is selected; and if the second node is not a coordinator node, the mesh routing sub-process is selected.

In accordance with another embodiment of the present invention, a process for discovering a route from a first node to a second node in a mesh network is described. The process includes broadcasting by the first node a route request message that is propagated across multiple nodes within the mesh network. The propagation follows a processor implemented process at the multiple nodes, including accepting a route request at a receiving node if (i) no previous received route request message had the same request ID, and (ii) the route request message is received through a link with a minimum LQI class at least equal to the requested one; identifying the receiving node as a route candidate if the route request message is accepted by an intermediate node; the route request is re-broadcasted. If the route request message is accepted the second node; sending a route reply message from the second node through the identified route candidate back to the first node to establish a static bidirectional route within the mesh network between the first node and the second node.

In accordance with a further embodiment of the present invention, a process for upgrading a route from a first node to a second node in a mesh network is described. The process includes: accepting a route request at a receiving node for upgrading the route if a route candidate already exists for the request ID, the request was received through a link with a minimum LQI class at least equal to the requested one and the request was received through a better link than the prior received one. These determinations are made according to the following sets of conditions: (i) the receiving node is a neighbor, the route request is received from a neighbor and a resulting route length is shorter; (ii) the receiving node is not a neighbor, the route request is received from a neighbor and a resulting route length is shorter or equal to existing route length; (iii) the receiving node is not a neighbor, the route request is received from a non-neighbor and a resulting route length is shorter. If the conditions are not met, the route request is rejected.

In accordance with a further embodiment of the present invention, a process for requesting a route from a first node to a second node within a mesh network is described. The process includes: transmitting a route request message to a pre-determined coordinator node, wherein the route request message includes a long address for the second node; constructing at the coordinator node a route through one or more routing nodes from the first node to the second node; and transmitting a response to the route request message to the first node including the route to the second node, wherein the route includes an assigned short address for the second node.

In accordance with a further embodiment of the present invention, a data structure for securing data frames transmitted in a single hop within a mesh network from a first node to a second node is described. The data structure includes a data link layer (DLL) security header located after a service-type octet when a predetermined security header flag is selected within the service-type octet. The DLL security header including: a first set of bits containing a portion of a transmitted nonce count; a bit following the first set of bits containing a key identifier (ID), wherein the key ID selects a current version of a key used for calculating a message integrity check (MIC); and a second set of bits containing the MIC.

In accordance with a further embodiment of the present invention, a process for validating integrity of message data transmitted in a single hop from a first node to a second node within a mesh network is described. The process including: checking at a processor of the second node the 23 least significant bits (0-22) of a count transmitted from the first node against a last authenticated count; if the transmitted count value is greater than the last authenticated count, combining at a processor of the second node, the 23 least significant bits (0-22) with the 17 most significant bits (23-39) of the last authenticated count to form a revised count; if the transmitted count value is lower than the last authenticated count, incrementing the value of bits 23 through 29 by one before combining at a processor of the second node, the 23 least significant bits (0-22) with the 17 most significant bits (23-39) of the last authenticated count to form a revised count; calculating at the processor of the second node a message integrity check (MIC) value using the revised count and pre-selected key; if the calculated MIC value equals a received MIC value, then the message data integrity is validated.

In accordance with a further embodiment of the present invention, a data structure for securing data frames transmitted in multiple hops using multiple nodes across a mesh network. The data structure including a network security header located after a data link layer (DLL) security layer within a mesh header. The network security header including: a first set of bits containing a network count; a bit following the first set of bits containing a network key identifier (ID); and a second set of bits containing a network message integrity check (MIC).

In accordance with a further embodiment of the present invention, a process for validating integrity of a data frame transmitted in multiple hops using multiple nodes across a mesh network. The process including: receiving a data frame at a receiver node, wherein the data frame includes a network security header including a network count, a network key identifier (ID) and a message integrity check (MIC); processing an identifier (ID) for an originating node that originated the data frame and a source field address to determine if the data frame was received from a coordinator node or a non-coordinator node; if the data frame was received from a coordinator node, the network key ID selects a node key for determining verification; if the data frame was received from a non-coordinator node, the network key ID selects a mesh key for determining verification. Further, when the received data frame is a request, a nonce is a combination of at least the network count, the originating node ID and an originating node address and the receiving node verifies the integrity of the frame by: adding a 0 to the network field to make a 40 bit field; calculating the received MIC using either the node key or the mesh key as identified by the network key ID; comparing the transmitted MIC with the received MIC, wherein the data frame is verified if the transmitted MIC is equal to the received MIC. And when the received data frame is a response, the network count is combined with the identifier and address for the target of the data frame and the originating node ID and an originating node address and the receiving node compares a network count in the response with a network count in the request, wherein the data frame is verified if the response network count is equal to the request network count.

BRIEF DESCRIPTION OF THE FIGURES

The following figures are intended to be read in conjunction with the specification set forth herein.

FIG. 1 shows a SecureMesh (SM) Architecture in accordance with an embodiment of the present invention.

FIG. 2 shows an SM Example Topology in accordance with an embodiment of the present invention.

FIG. 3 shows a Neighbor Information Request Process in accordance with an embodiment of the present invention.

FIG. 4 shows an Association Process in accordance with an embodiment of the present invention.

FIG. 5 shows an Association Confirmation Process in accordance with an embodiment of the present invention.

FIG. 6 shows Route Selection Processing in accordance with an embodiment of the present invention.

FIG. 7 shows Tree Routing Processing in accordance with an embodiment of the present invention.

FIG. 8 shows Source Routing Processing in accordance with an embodiment of the present invention.

FIG. 9 shows Mesh Routing Processing in accordance with an embodiment of the present invention.

FIG. 10 shows Temporary Routing Processing in accordance with an embodiment of the present invention.

FIG. 11 shows Temporary Routing in accordance with an embodiment of the present invention.

FIG. 12 shows Route Discovery, a complete process with no Route Candidate upgrade, in accordance with an embodiment of the present invention.

FIG. 13 shows Route Discovery, a complete process with Route Candidate upgrade, in accordance with an embodiment of the present invention.

FIG. 14 shows Route Establishment in accordance with an embodiment of the present invention.

FIG. 15 shows a Neighbor Information Exchange in accordance with an embodiment of the present invention.

FIG. 16 shows a Checkpoint in accordance with an embodiment of the present invention.

FIG. 17 shows a DLL Security Header in accordance with an embodiment of the present invention.

FIG. 18 shows an SM DLL Nonce in accordance with an embodiment of the present invention.

FIG. 19 shows a DLL Security MIC Coverage in accordance with an embodiment of the present invention.

FIG. 20 shows a Network Security Header in accordance with an embodiment of the present invention.

FIG. 21 shows a Network Security Nonce in accordance with an embodiment of the present invention.

FIG. 22 shows Network Security MIC Coverage in accordance with an embodiment of the present invention.

FIG. 23 shows a Network Security Process in accordance with an embodiment of the present invention.

FIG. 24 shows Association Request Security in accordance with an embodiment of the present invention.

FIG. 25 shows Association Response Security in accordance with an embodiment of the present invention.

FIG. 26 shows Security Key Updates in accordance with an embodiment of the present invention.

FIG. 27 shows Key Switching and Key Deactivation in accordance with an embodiment of the present invention.

FIG. 28 shows End Device Association in accordance with an embodiment of the present invention.

FIG. 29 shows End Device Parent Lost in accordance with an embodiment of the present invention.

FIG. 30 shows Communication with a Sleeping End Device in accordance with an embodiment of the present invention.

FIG. 31 shows Sleeping End Device Message Forwarding in accordance with an embodiment of the present invention.

FIG. 32 shows Sleeping End Device Checkpoint Frame Reception in accordance with an embodiment of the present invention.

FIG. 33 shows Sleeping End Device Checkpoint—No Frame in accordance with an embodiment of the present invention.

FIG. 34 shows Sleeping End Device Local Communications in accordance with an embodiment of the present invention.

FIG. 35 shows a Forwarding Service in accordance with an embodiment of the present invention.

FIG. 36 shows Power Event Notifications from Nodes in accordance with an embodiment of the present invention.

FIG. 37 shows a Multi-Hop Non-Leaf Node Report in accordance with an embodiment of the present invention.

FIG. 38 shows a Retry Power Event Report in accordance with an embodiment of the present invention.

FIG. 39 shows a One Hop Non-Leaf Node Report in accordance with an embodiment of the present invention.

FIG. 40 shows a Leaf Node Power Event Report in accordance with an embodiment of the present invention.

FIG. 41 shows a Mesh Multicast in accordance with an embodiment of the present invention.

FIG. 42 shows a Local Communication in accordance with an embodiment of the present invention.

FIG. 43 shows a Range Test in accordance with an embodiment of the present invention.

FIG. 44 shows a Frame Reception Rate Test in accordance with an embodiment of the present invention.

FIG. 45 shows a Ping in accordance with an embodiment of the present invention.

FIG. 46 shows a Frame format: Data transfer in accordance with an embodiment of the present invention.

FIG. 47 shows a Frame format: Mesh Multicast in accordance with an embodiment of the present invention.

FIG. 48 shows a Frame format: Route Request in accordance with an embodiment of the present invention.

FIG. 49 shows a Frame format: Route Reply in accordance with an embodiment of the present invention.

FIG. 50 shows a Frame format: Route Error in accordance with an embodiment of the present invention.

FIG. 51 shows a Frame format: Common routed message format in accordance with an embodiment of the present invention.

FIG. 52 shows a Frame format: Association Confirmation Request in accordance with an embodiment of the present invention.

FIG. 53 shows a Frame format: Association Confirmation Response in accordance with an embodiment of the present invention.

FIG. 54 shows a Frame format: Keep Alive Initiate in accordance with an embodiment of the present invention.

FIG. 55 shows a Frame format: Keep Alive Request in accordance with an embodiment of the present invention.

FIG. 56 shows a Frame format: Keep Alive Request: Optional extension: Trace Route in accordance with an embodiment of the present invention.

FIG. 57 shows a Frame format: Keep Alive Request: Optional extension: Multicast Group Addresses in accordance with an embodiment of the present invention.

FIG. 58 shows a Frame format: Keep Alive Request: Optional extension: Neighbors information in accordance with an embodiment of the present invention.

FIG. 59 shows a Frame format: Keep Alive Request: Optional extension: Statistics in accordance with an embodiment of the present invention.

FIG. 60 shows a Frame format: Keep Alive Response in accordance with an embodiment of the present invention.

FIG. 61 shows a Frame format: Keep Alive Response: Parameter list member: Current time in accordance with an embodiment of the present invention.

FIG. 62 shows a Frame format: Keep Alive Response: Parameter list member: Statistics in accordance with an embodiment of the present invention.

FIG. 63 shows a Frame format: Keep Alive Response: Parameter list member. SMIB parameter update in accordance with an embodiment of the present invention.

FIG. 64 shows a Frame format: Keep Alive Response: Parameter list member: Write-Switch-Deactivate Key in accordance with an embodiment of the present invention.

FIG. 65 shows a Frame format: Route Establishment Request in accordance with an embodiment of the present invention.

FIG. 66 shows a Frame format: Route Establishment Response in accordance with an embodiment of the present invention.

FIG. 67 shows a Frame format: Power Event Report in accordance with an embodiment of the present invention.

FIG. 68 shows a Frame format: Ping in accordance with an embodiment of the present invention.

FIG. 69 shows a Frame format: Service Forwarding in accordance with an embodiment of the present invention.

FIG. 70 shows a Frame format: Association Request in accordance with an embodiment of the present invention.

FIG. 71 shows a Frame format: Association Response in accordance with an embodiment of the present invention.

FIG. 72 shows a Frame format: Neighbor Info Request, originator is not a network member, in accordance with an embodiment of the present invention.

FIG. 73 shows a Frame format: Neighbor Info Request, originator is a network member, in accordance with an embodiment of the present invention.

FIG. 74 shows a Frame format: Neighbor Info Response, originator is not a network member, in accordance with an embodiment of the present invention.

FIG. 75 shows a Frame format: Neighbor Info Response, originator is a network member, in accordance with an embodiment of the present invention.

FIG. 76 shows a Frame format: Neighbors Exchange in accordance with an embodiment of the present invention.

FIG. 77 shows a Frame format: End Device Data Request in accordance with an embodiment of the present invention.

FIG. 78 shows a Frame format: End Device Data Request in accordance with an embodiment of the present invention.

FIG. 79 shows a Frame format: Service Request Request in accordance with an embodiment of the present invention.

FIG. 80 shows a Frame format: Service Request Response in accordance with an embodiment of the present invention.

FIG. 81 shows a Frame format: Common point-to-point messaging in accordance with an embodiment of the present invention.

FIG. 82 shows a Frame format: Local Data Transfer in accordance with an embodiment of the present invention.

FIG. 83 shows a Frame format: Frame Reception Rate Test Init in accordance with an embodiment of the present invention.

FIG. 84 shows a Frame format: Frame Reception Rate Test Data in accordance with an embodiment of the present invention.

FIG. 85 shows a Frame format: Frame Reception Rate Test End in accordance with an embodiment of the present invention.

FIG. 86 shows a Frame format: Frame Reception Rate Test Result in accordance with an embodiment of the present invention.

FIG. 87 shows a Frame format: Local Broadcast Request in accordance with an embodiment of the present invention.

FIG. 88 shows a Frame format: Local Broadcast Response in accordance with an embodiment of the present invention.

FIG. 89 shows a Frame format: Local Broadcast: Payload Content ID 1 in accordance with an embodiment of the present invention.

FIG. 90 shows a Frame format: Local Broadcast: Payload Content ID 2 in accordance with an embodiment of the present invention.

FIG. 91 shows a Frame format: End Device Node Present in accordance with an embodiment of the present invention.

FIG. 92 shows a Frame format: Range Test Request in accordance with an embodiment of the present invention.

FIG. 93 shows a Frame format: Range Test Response in accordance with an embodiment of the present invention.

FIG. 94 shows a Frame format: Range Test Initiate in accordance with an embodiment of the present invention.

FIG. 95 shows a Frame format: Range Test Result in accordance with an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

The following charts of terms and acronyms are intended to define the frequently used terms in the context of the preferred embodiments of the present invention. The definitions provided are not intended to define the entire scope of the term. One skilled in the art appreciates the various alternatives and variations that are clearly within the scope of the invention as described.

GLOSSARY OF TERMS

Association Router—Router selected by a Node which is not yet a member of the network, to act as a proxy to send the Node's association request.

Child—In the context of tree routing, all Routers in single-hop radio frequency (RF) contact with a reference Router, with a hop count greater than the hop count of that reference. In the context of End Devices, a Child refers to an End Device of a specific Router through which it sends and receives messages.

Dedicated Router—A router manually configured to associate to a specific network to guarantee that the network covers a specific geographical region.

Device Key—A key unique to the device. The initial device key is assigned by its manufacturer and is unchangeable. A database for device IDs and initial Device Keys is made available to the system owner and is installed in the network's Configuration Host. A Device Key generated by a Configuration Host should be known only to the Configuration Host and the device. Device Keys are used only for securing Application Layer communication between the Configuration Host and the device. As such, they are not directly part of the SM protocol, which encompasses only the data link layers.

Frame—A data-link layer message.

Key ID—Keys are updated from time to time; the specific generation of key is identified within this specification with a single bit Key ID, which is the low-order (even/odd) bit of the actual key generation count.

Key Type—Each key type has a specific usage, scope and is associated to a specific management process. This specification supports three Key types: the Maintenance Key, the Mesh Key and the Node Key.

Maintenance Key—This key is shared by all the devices in all PANs that are administered by a single Configuration Host. The Maintenance Key is used for Association Request/Response messages and maintenance device point-to-point-secured communication messages. The Maintenance Key can be factory-assigned or is assigned by the Configuration Host; it can be updated by a Coordinator.

Mesh Key—This key is used for all DLL MIC calculations, except those secured by the Maintenance Key. It is also used for the Network MIC when the message is broadcast through the mesh or when the Network Security is used for device-to-device communication. The Mesh Key is common throughout a PAN, and to all interconnected PANs that are configured to support inter-PAN communications. The Mesh Key is assigned and updated by the Coordinator.

Network Name—Name assigned to a mesh network. Network names are typically assigned using a dot separated hierarchy with the first level representing all mesh networks forming a single AMI network. The typical format of a network name is “utility.area.coordinatorID”.

Node Key—A unique key assigned to a device and used for secure communication between the Coordinator(s) and the device. It is primarily used for the Network MIC header calculation and for encrypting keys distributed by the Coordinator. The Node Key is initially assigned by the Configuration Host but it can be updated by either the Configuration Host or the Coordinator.

Node Type—Refers to the class of SM Node: Coordinator (=11_(b)), Router (=10_(b)), or End Device (=01_(b)).

Originator Count—The Originator Count, Orig. Count, is used as the nonce in the Network Security Header. Its value is the same as the Source Count value at the time the message is originated.

Parent—In the context of tree routing, all Routers that have a direct RF link with a reference Router and that have a hop count less than the hop count of that reference Router. In the context of an End Device, the Router used to send and receive messages on behalf of this End Device.

Frame—A network layer message that can traverse one or many hops.

SM Coordinator—Referenced within this document as Coordinator; this Node responsible for initializing the network, accepting association requests and assigning unique short addresses.

SM End Device—Referenced within this document as End Device; this Node is not capable of routing messages and can communicate only through its Parent. An End Device can be either always be listening or wake up periodically to synchronize with its Parent in order to minimize energy.

SM Node—Refers to a Node independently of its Node Type.

SM Router—Referenced within this document as Router; this Node is capable of managing routes and routing messages.

Sibling—In the context of tree routing, all Routers that have a direct RF link with a reference Router with a hop count equal to the hop count of that reference Router.

Sleeping End Device—A Sleeping End Device reduces it average power consumption by turning itself off for periods of time. It requires a Parent to store frames for it while it is sleeping. A Sleeping End Device cannot be used for routing.

Source Count—The Source Count, also referenced as Src. Count, is used as the nonce in the DLL Security Header. The Source Count is incremented with every message transmitted by the device.

Acronyms:

DLL—Data Link Layer, the data link layer provides device-to-device networking services in conjunction with the IEEE 802.15.4 MAC. For the SM system the DLL provides hop-by-hop security.

LQI—Link Quality Indicator a value based on the signal strength and other quality aspects of the received signal.

LQI class—Link quality between two Nodes expressed as four different classes: Good (=11_(b)), Normal (=10_(b)), Poor (=01_(b)) and No Connectivity (=00_(b)).

PAN—Personal Area Network, the IEEE 802.15.4 name for one of its networks, whether for personal use or not.

RSSI—Received Signal Strength Indication in dBm.

The following describes the message formats and the processes implemented by the SecureMesh protocol (hereafter “SM protocol”) within a SecureMesh network (hereafter “SM network”). Referring to FIG. 1, the SM protocol in conjunction with the IEEE 802.15.4 MAC layer implement the Open Systems Interconnection (“OSI”) Data-link. An exemplary SM network topology is shown in FIG. 2 and is composed of a coordinator 15, routers 20 and end devices 25 (generically referred to as “nodes”). The preferred routes 30 between routers 20 create a tree for which the root is the coordinator 15. Each node can be a member of trees of different adjacent networks, though any single network has only a single coordinator. A SM network may include non routing nodes called end devices which are associated to a preferred parent through which messages are sent and received. The SM protocol also supports routing of messages using alternate routes 35 when a preferred parent fails; this process is called local repair. In the preferred embodiments of the present invention, the nodes typically include utility meters and related devices, but the invention is not limited as such.

The transmission of messages between nodes defined by the SM protocol is governed by the following rules: (1) Fields are transmitted in their order of definition, from left to right when represented in a frame format diagram (see, for example, FIGS. 3-5), or from top (first) to bottom (last) when listed in a table; (2) All multi-octet fields are transmitted least significant octet first (little Endean); (3) Binary or string fields are transmitted serially starting at index zero. For backward compatibility reasons, short and long addresses can be configured as multi-octet fields transmitted least significant octet first, as specified by IEEE 802.15.4, or as binary fields transmitted serially. The transmission order of the addresses is controlled by the configuration parameter ADDRESS_TX_ORDER.

A critical process to SM network formation is the association process. The association process is used by nodes to become a member of an SM network or to evaluate their current association state. The association process incorporates the following primary functions: selection of a PAN; selection of an association router to proxy messages; association with the coordinator and the reception of a short address assignment; and construction of the initial neighborhood table.

As a first step in the association process, each device (referred to as a node once associated) must be commissioned with the network's node key and the network's maintenance key prior to associating with a network. The key commissioning process for a particular device is determined by the device's application. For example, the device may be configured at manufacturing, or by a maintenance tool, or through the Service Request and Service Response messages described in below. A quick summary of the association process is described, with a follow-on detailed description. A Neighbor Info Request is transmitted on each channel to locate and get information about neighbor nodes and neighbor SM networks. All nodes receiving the Neighbor Info Request respond with a Neighbor Info Response. A particular SM network is selected based on an Association Ratio algorithm, discussed further below. An Association Router, which is a member of the selected SM network, is selected based on the Preferred Route Ratio algorithm, also discussed below. An Association Request is transmitted to the selected Association Router by the requesting device. When the Association Router is not the Coordinator, the Association Request is repackaged and forwarded in the form of an Association Confirmation Request message to the Coordinator, using tree routing. If the Association Confirmation Request is received and validated, the Coordinator sends back the assigned short address in an Association Confirmation Response message, which is then repackaged and sent to the device as an Association Response message. Similarly, when the Coordinator receives the Association Request directly, it returns its response directly in an Association Response.

In the specific case of a successful association (i.e. the Association Status within the Association Response is set to successful), the Node sends a Neighbor Exchange message with the Immediate Broadcast Requested option set (discussed below) on the just associated SM network. As a result, this causes surrounding neighbors to broadcast a Neighbor Exchange message using a pseudo-random period within NEIGHBOR_EX_RND_PERIOD, thus allowing the Node to populate its Neighborhood Table right away.

Device association is started with the neighbor information request process shown in FIG. 3. Node-A initiates the process with a Neighbor Info Request that is broadcasted on a channel and received by other Nodes in the neighborhood that are listening to that channel. Each Node receiving the message responds at a pseudo-random time in the interval given by the parameter NEIGHBOR_INFO_RESP_TIME. The IEEE 802.15.4 MAC, known to those skilled in the art and described in numerous publicly available documents, resolves most collisions that occur due to Nodes selecting the same response time. Node-A waits for the interval NEIGHBOR_INFO_RESP_TIME to receive all Neighbor Info Response messages from its neighbors. Once the Node has received neighbor(s) information, it can start the association process.

In FIG. 4, Node-A is in the neighborhood of the Coordinator for PAN 1. As it receives Neighbor Info Response messages, it uses the Association Ratio algorithm and the Preferred Route Ratio algorithm to select PAN 1 and the Coordinator for PAN 1 as its Parent. In this case it sends its Association Request directly to the Coordinator and gets the Association Response back. Node-A expects to get a response back within a time period established by the ASSOCIATION_RESP_TIME parameter. This process is repeated on each available channel.

If the associating Node is not in the neighborhood of the Coordinator, it uses a neighbor to proxy the Association Request. FIG. 5 shows this proxy process. Node-A receives a number of Neighbor Info Response messages. It uses the Association Ratio algorithm and the Preferred Route Ratio algorithm to select the Coordinator for PAN 1 and Node-B as its best neighbor for the PAN. Node-A then sends Node-B the Association Request message and starts its response timer set with the value defined by ASSOCIATION_RESP_TIME. Node-B takes Node-A's request and generates an Association Confirmation Request message to the Coordinator. The Coordinator responds with the Association Confirmation Response message to Node-B and Node-B sends the Association Response message to Node-A.

As mentioned previously, the association process described in this section is also used by a network member to re-evaluate its association status. This action is performed every ASSOCIATION_EVAL_PERIOD and is intended to determine if the network member should remain on the same SM network or if it should migrate to another one. The Node will change its network membership (i.e. complete its association process on another network) only if the resulting Association Ratio represents an improvement compared to its current Association Ratio. The required improvement must be equal or better than the ASSOCIATION_EVAL_MIN_IMPROVEMENT. If it is not the case, the Node maintains its membership on the current network and the whole process stops immediately.

The mesh layer (see FIG. 1) routes frames to the target addresses by one of four processes: Tree Routing, Source Routing, Temporary Routing or Mesh Routing using combinations of the Neighborhood Table, Routing Table, and Temporary Route Table. The route selection processing facilitated by the mesh layer is shown in FIG. 6. The frame either arrives as a frame initiated by the Node (device) or as a received frame to be routed by the Node. Routed frames have an entry created in the Temporary Routing Table to allow subsequent traffic in the reverse direction using the reverse route. The routing process used for the frame is selected based on the following logic:

-   -   If the frame has a source route header it is sent to the Source         Routing process.     -   If there is an entry for the target address in the Temporary         Routing Table, the Temporary Routing process is used.     -   If the frame's target address is the Coordinator, the Tree         Routing process is used.     -   If the frame's target address is not the Coordinator, the Mesh         Routing Table process is used.

Tree routing is the preferred routing method when a Node initiates communications that target the Coordinator. Tree routing uses the Neighborhood Table to find a route to the Coordinator as shown in FIG. 7. The device selects the neighbor entry with the Preferred Parent Flag set in the Neighborhood Table. If transmission to the preferred parent does not succeed, the device attempts to select another Parent in the Neighborhood Table (e.g., an entry that has a hop-count value less than the device's hop-count value), preferably ordering the selection on the device's Preferred Route Ratio value. If there are no Parent entries left to try, the device looks for a Sibling entry (e.g., an entry that has the same number of hops to the Coordinator), preferably ordered based on the device's Preferred Route Ratio value. The device will try entries in the Neighborhood Table until it has reached the MAX_TREE_REPAIR limit or until the Neighborhood Table is exhausted. To avoid multiple lateral transmissions through Siblings, a flag in the mesh header called Sibling flag is set when transmitting to a Sibling. Frames received with the Sibling flag set can be routed only through a Parent.

Referring to FIG. 8, source routing is the preferred routing method when communications initiated from the Coordinator targets a specific Node. The Coordinator can also use the broadcast address as the target address at the end of the source route list to send a message to all the Nodes that are the neighbors of the last explicitly-addressed device. Source addressing is also used for communication between any two Nodes if the originator knows the entire route between them. This node-to-node source route is determined by a Route Request to the target Node with the Trace Route Flag set, or by a Route Establishment Request sent to the Coordinator asking for a route to the target Node. The source routing process sends a frame with the complete route embedded in the frame header. The Node receiving a source-routed frame finds its address in the route list and uses the next address in the list as the next destination hop for the frame. A temporary return route is created when a source-routed frame is received by each Node on the path, so that upstream frames can be routed using the Temporary Routing Table.

Unlike tree routing, which can only be used to reach the Coordinator, mesh routing can reach any Node on the network. Routes are established using the Route Discovery process which is described later. The routes are stored in a Route Table, whose entries contain the next hop for the target address. A route remains valid until a Node tries unsuccessfully to use it or a Route Error message is received deleting the Route Table entry. A Node that cannot send a frame to the Node listed in the Route Table generates a Route Error message and deletes the entry from its Route Table. The oldest Route Table entry may also be deleted when a Node needs space in its Route Table for a new entry. The use of mesh routing should be limited because of the overhead it imposes on the network. This method is used only when more preferred methods such as tree and source routing fail. Referring to FIG. 9, the mesh routing process looks up the target address in the Route Table. If the target address is found, the frame is sent to the designated Node. An error is generated when the MAC layer ACK is not received after repeated attempts or a Route Error message is received. In either case the route entry is removed from the Route Table and a Route Error message is broadcast to all neighbors. A Route Error message is also generated if the target address is not found in the Route Table.

Every time a mesh frame is forwarded, no matter the routing method used with the exception of the Temporary routing itself, the forwarding Node creates a temporary route entry to the originator in the Temporary Routing Table. This allows the destination Node to quickly send a reply, even if it didn't previously know the route to the originator Node. This route expires after a period of time determined by TEMP_ROUTE_TO parameter. The Temporary Route Table takes precedence over the Neighborhood Table and the Route Table. Referring to FIG. 10, the Temporary Route Table is accessed and the MAC destination address associated with the mesh layer target address is selected. The frame is then transmitted. If the MAC fails to transmit a frame, the Error Received condition is true and the Node tries to send the frame by an alternative route using Tree Routing or Mesh Routing.

In FIG. 11, a mesh message from Node A sets the temporary return route in the table of Node B. A mesh message from Node C to Node A is routed to Node B. Node B's temporary return route to Node A has not expired and so it uses the route to send the message to Node A. Sometime later another mesh message from Node A restarts the temporary route expiration timer. After the time, TEMP_ROUTE_TO, no new messages from Node A arrive and Node B deletes the temporary return route to Node A. The number of temporary return routes that can be stored is limited. If the limit is reached, the oldest temporary return route is deleted when a new temporary return route is created.

A route discovery process is performed when a Node needs to create or trace a new route within the mesh network. It consists of a mesh broadcast of a Route Request message which is propagated through the network based on Route Request Acceptance Conditions. Once received by the target Node, a Route Reply message is returned to the originator leading to the creation of a new static route in both directions.

Initially, Route Request acceptance conditions are verified by each Node receiving a Route Request message. This verification algorithm allows a Router to forward or stop the propagation of a Route Request. When acceptance conditions are satisfied, the Router from which the Route Request message was received is keep as a Route Candidate. A Route Candidate can be replaced based on Route Request acceptance conditions during the mute discovery process to improve routing. Route Candidates are used at the end of the route discovery process when the Route Reply message is sent back to the originator. A Route Request is accepted as the first Route Candidate if it meets all of the following conditions:

-   -   No previous received request had the same Request ID; and     -   The request is received through a link with a minimum LQI class         (defined later) at least equal to the requested one. For         compatibility reasons, Route Requests received from non-neighbor         Nodes are accepted if the requested minimum LQI class is         “Unreliable link.”

A Route Request is accepted for Route Candidate upgrade if it meets all of the following conditions:

-   -   A Route Candidate already exists for this request ID; and     -   The request was received through a link with a minimum LQI class         at least equal to the requested one. For compatibility reasons,         Route Requests received from non-neighbor Nodes are accepted if         the requested minimum LQI class is one (Unreliable link); and     -   The request was received through a better link than the prior         received one, as determined by one of the three cases summarized         below:

TABLE 1 Route Candidate upgrades conditions Conditions Case #1 Case #2 Case #3 Current Route Neighbor Non-Neighbor Non-Neighbor Candidate is a . . . Route Request Neighbor Neighbor Non-Neighbor received from a . . . The new Route Shorter Shorter or Shorter Candidate length is . . . Equal

The overall route discovery process is summarized in FIG. 12 which illustrates the simplest case, i.e., without any Route Candidate upgrade. The effect of a Route Candidate upgrade is shown in FIG. 13, in which the return path is updated during the route discovery process. The originator broadcasts a Route Request with a minimum LQI class of “Reliable link.”

Every Router receiving the Route Request accepts or rejects the request based on conditions discussed above. If the Route Request is accepted as a first route candidate and the Router is not the target destination, it creates a route candidate to the originator and rebroadcasts the Route Request. If the Router is the target destination, it starts a timer of RREQ_RX_TIME milliseconds and creates a route candidate to the originator.

If the Route Request is accepted for a route candidate upgrade, the Node upgrades its route candidate without re-broadcasting the Route Request. At the expiration of the timer that was initialized to RREQ_RX_TIME, the destination Node converts its route candidate into a static route and sends a Route Reply to the Next Hop of the route just created. Each Node receiving a Route Reply converts its route candidate into a static route to the originator. It also creates a static route entry to the destination. The Route Reply is then forwarded to the originator. If the originator does not receive a Route Reply after the RREQ_TO timeout period (700 ms by default), it broadcasts a second Route Request with a minimum LQI class set to “Average link.” If this second attempt fails, the originator tries a third and last attempt with a minimum LQI class set to “Unreliable link.” If the three attempts of broadcasting a Route Request fail, an error is returned to the upper layer. FIG. 12 illustrates the Route Discovery process with no Route Candidate upgrade. FIG. 13 illustrates the Route Discovery process with Route Candidate upgrade. If the trace route option is set in the Route Request message, the target Node will set the trace route option in the Route Reply message. In this case, intermediary Routes create a temporary route instead of a static route and the route is recorded in the Route Reply message. The originator of the request can subsequently use the temporary route or source routing to reach the destination. Each Route Request is identified by a unique combination formed by the originator's short address and the Request ID. It is then possible to identify a Route Request already received from another Node.

Referring to FIG. 14, Route Establishment is a process in which a Node asks the Coordinator for a source route to another Node. The originator Node uses the target's 8-octet long address in its request. The Coordinator constructs a route using its current knowledge of the SM network. The Neighbor information contained in the periodic Keep Alive Request messages sent by Nodes is a prime source of information used by the Coordinator to construct routes. The Route Establishment response contains the source route to the target and the target's assigned short address. A route established from Node-A to Node-B is used for one-way communication. When Node-A sends a message to Node-B that requires a reply, Node-B uses the temporary route set up along the route by Node-A's message.

The neighbor exchange process is performed by all Nodes on a periodic basis. The Neighbors Exchange process is used to update neighbor information and routing tables. Each Node in the network generates a periodic Neighbors Exchange message. All Nodes receiving the request update their Neighborhood Table. FIG. 15 shows one Neighbor Information Exchange broadcast message transmitted by Node-A, which is received by Nodes B, C and X.

An LQI measure is taken each time a Neighbors Exchange is received. The value “LQI rx” in the Neighborhood Table is updated according to Table 2.

TABLE 2 Calculation of “LQI rx” Measured LQI > LQI_HIGH_FACTOR of the “LQI rx” present “LQI rx” in the in the table plus (1-LQI_HIGH_FACTOR) table of the measured LQI of received message Measured LQI < LQI_LOW_FACTOR of the “LQI rx” present “LQI rx” in the in the table plus (1-LQI_LOW_FACTOR) table of the measured LQI of received message Neighbors Exchanged Keep the LQI present in the table missed for the first and second time Neighbors Exchanged Keep LQI_MISSED_EX_FACTOR of the missed for the third LQI present in the table or further time Neighbors Exchanged Entry disable in the table missed for the 5th time

These rules tend to keep the “LQI rx” in the Neighborhood Table high even if a particular LQI measurement is lower or if a single Neighbors Exchange is missed. This is intentional.

Tree optimization is a recurrent process performed by all Nodes to ensure the network's optimal performance. The preferred route toward the Coordinator is re-evaluated after each Neighbors' Exchange message is received. To avoid tree instability, the “Avg LQI” factor is omitted for tree optimization; it is used only at association when a Node selects its initial preferred route. Only one route change is allowed per 6 cycles of NEIGHBORS_EXCHANGE_PERIOD to provide enough time for the information to propagate in the network. This delay limits the rate at which Child Nodes change their route when the route quality improves.

Each Node on the network shall report its presence to the Coordinator from time to time using Keep Alive Request messages to maintain its association status. The reporting period is determined by the CHECKPOINT_PERIOD and is typically set to be one hour. The period between Keep Alive messages should be constant as specified by the Keep Alive Period field within the Keep Alive Request message. The Coordinator flags a Node as Non Responding if this Node fails to communication with it within the Keep Alive Period. If the Coordinator has not received a Keep Alive Request or a Power Event message in a specified time, it removes the device from is registration table. The Coordinator's timeout period for Keep Alive Request/Power Event messages can be as long as 90 days. The Checkpoint process is also used to: trace the latest tree route for subsequent requests using source routing; send network management information such as network statistics and neighborhood information; allow configuration of mesh layer parameters controlled centrally; and provide a window of opportunity for the upper layer batch traffic.

The Checkpoint is initiated autonomously by each Node. Checkpoint reporting by each Node is distributed pseudo-randomly within the CHECKPOINT_PERIOD. If the Coordinator needs to have better control over timing of the traffic generated on the network, it can send a Keep Alive Initiate request prior to the autonomous transmission of the Keep Alive Request. The Keep Alive Initiate request relies on the routing information of the previous Keep Alive Request. If this information is out of date, the subsequent autonomous Keep Alive Request sent by the Node will reestablish a valid route. It is important to note that a Keep Alive Initiate request does not create an entry in the Temporary Route table, thereby allowing the subsequent Keep Alive Request to trace the currently optimized tree route. In FIG. 16, Node A sends a Keep Alive Request frame to the Coordinator as triggered by expiration of its CHECKPOINT_PERIOD timer. The Coordinator receives the request and sends a Keep Alive Response frame. The originator Node does not retry the request if it does not receive a reply. After a successful reception of the Keep Alive Response, or timeout of a watchdog timer preset to the value of the parameter COORD_RESPONSE_TIMEOULT, upper layers are notified so they can start exchanging information if needed.

There are three security services provided by the SM network and protocol: privacy, authentication and authorization. Initially, though not all data transmitted throughout the SM network has to be kept private, there are instances where the data sent should be encrypted to protect it from discovery. For example, security key configuration information needs to be kept private. Additionally, data is authenticated in two ways. First the data's integrity is checked to make sure that it has not been changed when transmitted through the network. Data integrity is verified from the source to the destination through one or more hops in the mesh network. Like the data, the address is protected from being changed undetectably. If the key used to protect that address is unique to the source, then the authentication verifies the integrity of the source address and that the stated sender originated the message frame. Further, the operations in messages have permission requirements associated with them. Devices originating messages have authorizations configured in the SM network that give the devices the permission to perform operations that match the permission requirements.

The SM network protocol provides security for management frames routed through the mesh. These routed frames may span more than one hop and therefore need end-to-end security. The security features used by the SM network protocol are authentication and authorization. The mesh layer operations do not require privacy, other than for the transmission of security keys, where the privacy is provided by encrypting the transported keys. The SM protocol provides data link security services for hop-by-hop message transmissions. The SM data-link protocol provides data and source authentication for each hop taken by the message. It also provides operation authorization for local communication with maintenance devices. This security level also provides replay protection for all local and routed communication. Table 3 summarizes the implemented security mechanisms in accordance with a preferred embodiment of the present invention, the behavior of data link and network level counters and the key type used for each message type. For each message type in Table 3, the security method and key specified must be used or the receiver rejects the entire message.

TABLE 3 Security Counter and Key type Summary Data link layer security Network layer security Counter When Key Counter When Key Security sent received type Security sent received type Route discovery Route Request MIC-32 Src. count >last (n) S None Route Reply MIC-32 Src. count >last (n) S None Route Error MIC-32 Src. count >last (n) S None Routed services Data transfer MIC-32 Src. count >last (n) S None Power Event MIC-32 Src. count >last (n) S None Ping Request MIC-32 Src. count >last (n) S None Ping Response MIC-32 Src. count >last (n) S None Keep Alive Initiate MIC-32 Src. count >last (n) S MIC-32 Orig. count [>last] N Keep Alive Request MIC-32 Src. count >last (n) S MIC-32 Orig. count [>last] N Keep Alive Response MIC-32 Src. count >last (n) S MIC-32 Orig. count [>last] N Service Forwarding request MIC-32 Src. count >last (n) S MIC-32 Orig. count [>last] N Service Forwarding response MIC-32 Src. count >last (n) S MIC-32 Reflection =sent N Association Confirmation Request MIC-32 Src. count >last (n) S MIC-32 Orig. count [>last] N Association Confirmation Response MIC-32 Src. count >last (n) S MIC-32 Reflection =sent N Route Establishment Request MIC-32 Src. count >last (n) S MIC-32 Orig. count [>last] N Route Establishment Response MIC-32 Src. count >last (n) S MIC-32 Reflection =sent N Non routed services Neighbor Info Request None None Neighbor Info Response None None (Src count, Ticket) Service Request None None Service Response None None Association Request MIC-32 Ticket >last (rc) M MIC-32 Orig. count any N Association Response MIC-32 Src. count >last (rc) M MIC-32 Reflection =sent N Neighbors Exchange MIC-32 Src. count >last (n) S None End Device Data Request MIC-32 Src. count >last (ed) S None End Device Data Response MIC-32 Src. count >last (n) S None Multicast data transfer Mesh Multicast MIC-32 Src. count >last (rc) S None Point to point communication Local Broadcast Request None None Local Broadcast Response None None (Src count, Ticket) End Device Node Present None None (Src count, Ticket) Local Data Transfer None None Range Test Request MIC-32 Ticket >last (rc) M None Range Test Response MIC-32 Src. count >last (rc) M None Range Test Initiate MIC-32 Ticket >last (rc) M None Range Test Result MIC-32 Src. count >last (rc) M None Frame Reception Rate Test Init MIC-32 Ticket >last (rc) M None Frame Reception Rate Test Data MIC-32 Ticket >last (rc) M None Frame Reception Rate Test End MIC-32 Ticket >last (rc) M None Frame Reception Rate Test Result MIC-32 Src. count >last (rc) M None

In Table 3, the following define the behavior of the counters sent: “Src. count” is the value of the current counter of the sender of the frame (Single Hop); “Orig. count” is the value of the current counter of the originator of the frame within the mesh network; “Reflection” is the response use of the value of the counter received in the request: “Ticket” is the Counter provided by a Router for use by Nodes before they are associated and for maintenance devices that communicate with the device using point-to-point messages. The nonce is created by concatenating full five octet ticket with the long address of the Router providing this ticket. Also in Table 3, the following define the behavior of the counters received. The “[>last]” means the recipient of the frame, may accepts any counter value, playback rejection is not required since playback is already verified by the DLL security at each hop. Optionally, if the recipient has the memory to store the previously received counts it may reject frames where the count is not greater than the stored count. The “=sent” means the counter received must be equal to the counter sent in the request. The “>last (n)” means the counter received must be greater than the RX Source DLL Nonce Count value maintained in the Neighborhood Table. The Neighbor Info Response frame initializes the RX Source DLL Nonce Count in the Neighborhood Table. The periodic Neighbor Exchange message maintains its currency in the absence of regular traffic between the two devices. The “>last (ed)” means the counter received must be greater than the last RX Source DLL Nonce Count value maintained in the End Device Table. The periodic End Device Data Request message maintains its currency. And the “>last (rc)” means the counter received must be greater than the last RX Source DLL Nonce Count value temporary maintained for a selected Node and acquired in the Neighbor Info Response or Local Broadcast Response.

The “last” counts are initialized to zero in the tables and then updated with the first authenticated reception. The following letters are used in Table 3 to define the key type used by each message type. “N” is (private) Node Key; “S” is Shared Mesh Key; and “M” is (shared) Maintenance key.

The SM protocol provides a DLL Security service with data and source authentication using a message integrity check mechanism (MIC-32) as described in Annex B of IEEE 802.15.4:2006 which is incorporated herein by reference in its entirety. DLL security uses the SM DLL Security header to select the security key and set the nonce used in the crypto calculation. The DLL Security header is an optional field, following the Service Type octet, that is present when the DLL Security Header Flag in the Service Type octet is set (=1b), as defined herein. The format of the DLL Security header is shown in FIG. 17. The first fifteen bits (0 . . . 14) of the DLL Security header contains a portion of the transmitted nonce count. Bit 15 is the DLL Key ID that selects the current version of the key used to calculate the DLL MIC. This Key ID is used to coordinate the key used during a key change process by explicitly identifying which key was used in generating the DLL MIC.

The MIC-32 data authentication calculation uses the calculation process described in the IEEE 802.15.4:2006 standard. The SM DLL nonce used for the MIC calculation is shown in FIG. 18. The DLL nonce used in the MIC calculation is thirteen octets. The DLL Security nonce combines the full DLL nonce count and the MAC layer source address used by the transmitting device. The Full DLL Nonce Count is five octets long, which ensures that its value does not repeat, within the lifetime of a key, at the frame transmission rates of SM devices. The address used in the MAC nonce is either the 8-octet long EUI address, or the 2-octet source PAN ID plus the 2-octet short address prefixed by four octets of all ones. The Full DLL Nonce Count can be based on either the Source counter or the Ticket counter.

TABLE 4 DLL Nonce Counters DLL Counter Type Source counter Ticket counter Count Range 0000000000 to EFFFFFFFFF E000000000 to FFFFFFFFFF Use Used as the transmitted count by devices Used as the transmitted count by devices not associated with a network associated with a network, devices associating with the network or handheld devices communicating using the point-to-point messages Message Count incremented with each transmission Count incremented with each transmission Transmitter Stored in non-volatile memory and never reset For the associated devices, the Ticket is acquired in the Neighbor Info Response. For the associating devices, Ticket is acquired in the Local Broadcast Response or End Device Node Present messages The last authenticated value is stored only while communicating with a selected device Message For the associated devices, the count value is Accepts received counts > stored ticket Stores last Receiver acquired in the Neighbor Info Response or authenticated count in the Maintenance Table Neighbors Exchange messages. The last authenticated count is stored in the Neighborhood Table For the non associated devices, the count value is acquired in the Local Broadcast Response or End Device Node Present messages. The last authenticated value is stored only while communicating with a selected device Accepts received counts > stored count Nonce MAC source long address, or 0xFFFFFFFF MAC long address of the device that provided the Address padding and MAC source PAN ID and short ticket address

This process is used for all message types using the Source Counter as listed in the summary table in Table 3. The five octets (bits 0-39) of the Full DLL Nonce Count are constructed using the following algorithm: The least significant octet (bits 0-7) of the transmitted nonce count is the IEEE 802.15.4 MAC header sequence number. The next 15 bits come from bits 0 through 14 of the DLL Security header's SM DLL Count. Together the 23 bits of the transmitted count forms the least significant bits of the counter portion of the SM DLL nonce. The receiver checks the least significant 23 bits of the transmitted count against the last authenticated RX Source DLL Nonce Count. In the case of an End Device, the last authenticated RX Source DLL Nonce Count represent the Source Count acquired using a Neighbor Info Request and maintained in the End Device Table. In the case of mesh messages excluding the Association Request, the last authenticated RX Source DLL Nonce Count represents the Source Count acquired using a Neighbor Info Request and maintained in the Neighborhood Table. The Neighborhood Table entry is selected using the source PAN ID and MAC address of the received message. In the case of an Association Request or of point to point messages, the last authenticated RX Source DLL Nonce Count represents the Source Count acquired using a Neighbor Info Response, a Local Broadcast Response or an End Device Node Present received and maintained temporarily for a selected Node. If the transmitted count value is greater than the last authenticated RX Source DLL Nonce Count, then the transmitted counter bits (0-22) are combined with the most significant bits (23-39) of the last authenticated RX Source DLL Nonce Count to form the Full DLL Nonce Count. However, the transmitted count is assumed to have rolled over if the transmitted count value is less than the value of the corresponding bits in the last authenticated RX Source DLL Nonce Count. When this is the case the value in bits 23 through 39 of the last authenticated RX Source DLL. Nonce Count is incremented by one before it is combined with the transmitted bits to form the Full DLL Nonce Count. The MIC-32 is calculated using the Mesh key generation specified by the DLL Key ID. The selected key and the Secure Full Mesh DLL Nonce are used to calculate the DLL MIC-32 value. If the calculated MIC-32 equals the transmitted MIC-32, then the message data integrity is validated and the message has not been received previously. In this case the last authenticated RX Source DLL Nonce Count is updated to the value of the Full DLL Nonce Count used in the MIC calculation.

The SM DLL security nonce ticket counter process is used for all message types using the Ticket Counter as listed in the summary table in Table 3. This process is used for the secured non-routed DLL communications employed by Association Request/Response messages and by point-to-point messages. For these messages at least one of the MAC addresses has a long 8-octet format, the Maintenance Key is used, and the process is modified. The DLL Key ID selects the appropriate Maintenance Key and nonce count. The following algorithm is used to calculate the MIC. The five octets (bits 0-39) of the Full DLL Nonce Count are constructed using the following algorithm: the least significant octet (bits 0-7) of the IEEE 802.15.4 MAC header sequence number is combined with bits 0 through 14 of the DLL Security header. Together they form the 23 bits of the transmitted count bits of the DLL nonce count.

The Ticket field in the Maintenance Key Table contains the last authenticated count received. The receiver checks the least significant 23 bits from the table and compares them to the transmitted count. If the transmitted count value is greater than the value in the corresponding bits of Ticket then the transmitted counter bits (0-22) are combined with the most significant bits (23 . . . 39) of the Ticket to form the Full DLL Nonce Count. However, if the transmitted count value is less than the value of the corresponding bits in the Ticket, rollover of the transmitted count value is inferred. When this is the case the value in bits 23 through 39 of the Ticket is incremented by one before it is combined with the transmitted bits to form the Full DLL Nonce Count. The MIC-32 is calculated using the key specified by the Maintenance Key selected by the DLL Key ID and the Full DLL Nonce Count. If the calculated MIC-32 equals the transmitted MIC-32, then the data integrity is validated and the message has not been received previously. In that case only, the Full DLL Nonce Count is stored in the Ticket Count of the Maintenance Key Table.

The DL Security header MIC covers the SM message starting with the IEEE 802.15.4 Frame Control octet and continuing on through to the end of the payload. As shown in FIG. 19, the IEEE 802.15.4 physical layer preamble and the Frame Check Sequence are not part of the DLL Security calculation.

The DLL Security header provides security for data authentication and operation authorization of SM messages that can travel one hop. The SM network security header provides end-to-end security for frames, which can travel multiple hops. When present, the network security header provides authentication of data that is not dependent on trusting the intermediate routing devices. The network security header controls security for that portion of the SM frame that does not change as it is routed through the network. The network security header is present when the Originator Network Security Header flag is set as defined in the common mesh header described below

The network security header is shown in FIG. 20. It is located in the SM header after the DLL Security header. The network security NET MIC-32 field is located at the end of the frame, before the DLL MIC-32 field and the IEEE 802.15.4 FCS field (see FIG. 22). When the Network Security header is present, the receiver's SM application layer security process uses the Originator PAN ID and source address field of the received frame to determine if the frame is from the Coordinator or some other device. The Node Keys stored in the Node Key Table are used for communicating with the Coordinator. The Mesh Keys in the Neighborhood Table are used to communicate with other devices. For frames received from the Coordinator, bit 39 of the Network Security Header specifies the network Key ID, selecting Node Key-0 or Node Key-1. For frames received from other devices, the bit selects Mesh Key-0 or Mesh Key-1.

Routed messages are typically request/response messages. The response messages reflect the value of the Network Count in the request. Messages that require reflected counts are listed in Table 3.

The SM network layer nonce is 13 octets long. Its structure is shown in FIG. 21. When the message is a request, the combination of the Network Count, the Originator PAN ID and Address padded with zeros ensures the uniqueness of the nonce. When the message is a response the Network Count is reflected and it is combined with the Target PAN ID and address and the Originator PAN ID and address. Devices receiving request messages use the Network Count to verify the integrity of the payload data and optionally check for repeated count values to reject already received responses. Devices receiving responses to request messages check that the Network Count equals that in the request message. If it does not, the message is rejected. Response frames with repeated Network Count values also are rejected.

The SM Network MIC-32 is authenticated using the following algorithm. First, the 39 bits of the Network Count is taken from the Network Security Header and padded with a zero to make a 40 bit field. This forms the counter portion of the network nonce. Next, the MIC-32 is calculated using the key specified by the Network Security header Key ID, using the Node Key for communications with the Coordinator and the Mesh Key for communications with other devices.

If the calculated MIC-32 equals the transmitted MIC-32, then the data integrity of the received frame is validated. The coverage of the Network Security header MIC is shown in FIG. 22. The Network MIC-32 provides authentication for almost all the SM frame's header field and payload. The portion of the SM frame's header field that is not covered by the Network MIC is the Max Remaining Hops field, which is decremented for each hop. Keep Alive Request messages have a second exception to the Network MIC-32 coverage: their Hop Addresses and Number of Hops fields. As with the DLL, having two key in each of the Mesh Key Table and Node Key Table entries allows the Coordinator to set up new keys for devices without causing Network Security header MIC errors.

The SM network security process used for transmitting a message with a Network Security header is shown in FIG. 23. Node-A prepares a request message for transmission by incrementing its source transmission counter and calculating the Network MIC. It then formats the request frame with the full five octet source transmission count in the Network Security header and transmits the message through Node-B to Node-C. Node-A stores the count used and starts a message response timer with a timeout set to MESSAGE_RESPONSE_TO. Node-C receives the request message and authenticates the Network Security header. Node-C prepares a response to Node-A using the same count value it received in the request. Node-A receives the response and checks that the count value is the same as what it transmitted. Node-A releases the stored count and stops the message response timer if the stored count is the same as the response count and the Network Security header is authenticated. If the tests fail and no other valid response frame is received in the timeout period, Node-A fails the request/response process and releases the stored count value. Messages transmitted between the Coordinator and a device that employ the Network Security header use the Node Key assigned to the device. Messages transmitted between devices that have a Network Security header use the Mesh Key.

New devices associating with a network must be configured with the Node Key and Maintenance Key. This configuration may be done by the manufacture as a custom process for a purchaser, by a maintenance tool prior to association or over the network using the Service messages described further herein. Keys transported over the network must be encrypted for confidentiality. When sent in Service Response and Service Forwarding messages, the keys are generated by the Configuration Host and encrypted using the device's Device Key before being placed in the message payload. The Coordinator and the routing devices forward the encrypted keys without knowing the Device Key, so they are unable to eavesdrop on the value of the new key. This configuration process is between the device's application and the Configuration Host application. It is not part of the overall mesh protocol. An outline of the device application to configuration host application configuration process is presented here for informational purposes. The new device uses a Service Request message to talk to the Configuration Host. The outgoing Service Request message contains a Service MIC in the payload that is calculated using the manufacturer-supplied Device Key. (This Service MIC is not the DLL or Network MIC.) The routing device forwards the payload in a Service Forwarding message and the Coordinator sends the message to the Configuration Host. The routing device and the Coordinator do not have the Device Key and so they do not decode the MIC. The Configuration Host uses a well known Server ID (=0) in the Service Request message. The Configuration Host looks up the 8-octet device MAC address and finds the Device Key in its database. If the MIC is OK it authenticates the new device. The Configuration Host sends a message to all Coordinators in the network that sets up a unique Node Key associated with the 8-octet device MAC address. This is a symmetric secret key that will be used for all secure communications between the Coordinators and the new device. In preferred embodiments, Node Key-0 and Node Key-1 are set to the same value to avoid key synchronization problems as the system starts. This same value practice holds for the Maintenance Key-0 and Maintenance Key-1 values as well. After sending the Node key to the Coordinators, the Configuration Host sends a response to the new device using a Service Forwarding Response or Service Response message, where the message payload contains the unique Node Key and the shared Maintenance Key, both encrypted by the new Node's Device Key. This response is sent back to the new device. The new device decrypts the Node Key and the shared Maintenance Key and stores them under the appropriate Key ID.

A device that is newly introduced to a SM network has only a single cryptographic key: its factory-assigned permanent Device key, which is unique to the device. Before the device can participate in the SM network, the device must be commissioned with the network's Maintenance and Mesh keys, together with a device-unique Node key and a second system-assigned device-unique Device key. This commissioning may be made over the network itself, by direct wireless messaging to the device from a proximate commissioning device, or through some extra-protocol means, such as a direct connection to the device.

The Maintenance, Mesh and Node keys are used to authenticate messaging within the SM. Node keys are used to authenticate and encrypt end-to-end network management messaging within the SM. The permanent Device key is used only to authenticate the newly introduced device to the SM network and to protect the system-assigned Device key when it is sent in response to the newly introduced Node. The system-assigned Device key is then used to protect the device's Node key and the shared Maintenance key when they are distributed to the Node. In subsequent messages, the device's Node key is used to protect the Mesh key whenever it is distributed to the Node. Receipt of a message that authenticates under the permanent Device key zeroizes all other keys, setting them to a “keyNotDefined” status, which restores a device's key state to that when it left the factory. This action protects the network against an attacker that has compromised the device's permanent Device key, perhaps by gaining access to the database of all permanent Device keys that exist at key repository, or to the subset database of Device keys of purchased devices that was delivered to the system owner.

A secure association between a device and a Coordinator uses the Association Request and Association Response messages that employ the DLL MIC and Network MIC. The associating device uses the Maintenance Key Ticket count value for the DLL MIC and the Node Key and Originator count value for the Network MIC. The routing forwards the Association Request payload to the Coordinator in the Association Confirmation Request message. The payload also includes the 8-octet MAC address of the new device. This forwarding process is shown in FIG. 24. The Coordinator validates the Association Confirmation Request message DLL Security header and Network Security header. It then validates the embedded Network Security header constructed by the new device using the new device's Node ID and the Originator count in the Network Security header. The Coordinator looks up the Node ID using the 8-octet address in the Association Confirmation Request message in a data base that has been configured by a process outside the scope of the mesh protocol. For valid association requests the Coordinator constructs an Association Confirmation Response message. The message payload has the assigned short address of the new device, the Mesh Key Security Header, the Encrypted Mesh Key and the Mesh Key MIC32. The Mesh Key is encrypted using the new device's Node Key version as specified in the Mesh Key Security Header. The Coordinator constructs a Network Security header and that calculates the Network MIC using the Coordinator's reflected count in the new device's Network Security header and the new device's Node Key. This Network Header is carried as the payload of the Association Confirmation Response message shown in FIG. 25.

The Mesh Key Security Header follows the same format as the 40-bit Network Security control word shown in FIG. 20 with the Reflected Count Flag set to 0. The routing device that forwards the association response to the new device takes the payload of the Association Confirmation Response message and generates the Association Response message using the Maintenance Key and the router's Source count value to calculate the DLL MIC. The new device decrypts the Mesh Key using the Node Key with the Key ID specified in the Encrypted Key Security Header, it then verifies the Mesh Key MIC32 and stores the Mesh Key. Devices that change the primary Coordinator with which they are associated follow the same procedure as new devices. They use the same Association and Association Confirmation messages and the same Node Key and Maintenance Key.

Preferred embodiments of the present invention institute key rotation practices; changing the security keys periodically or when a security event has occurred. The mesh keys used by a device are the Node Key, the Maintenance Key and the Mesh Key. The Coordinator changes these keys using the Keep Alive process and messages.

Each device maintains two versions of each of these keys: Node Key-0, Node Key-1, Maintenance Key-0, Maintenance Key-1, Mesh Key-0 and Mesh Key-1. Each message sent has Key IDs in the DLL Security header and Network Security header that indicate which key is being used. In between key changes all the devices use only one version of each key for transmission and reception. The Coordinator writes the new key to the appropriate key and key version of each device. When the update process is finished and verified at most or all relevant devices, the Coordinator signals the devices to start using the new key for transmission. After all the devices are using the new key for transmission, the Coordinator deactivates the old key for reception.

The Coordinator starts an update of a key by getting the current state of the current Write Key Toggle Bit associated with the key. It does this by waiting for a Keep Alive Request message from a device with the key as shown in FIG. 26. The Keep Alive Request message from the device contains the Write Key Toggle State field that tells it current status of the toggle bits for each key. The Coordinator then sends the key update using the Write Key parameter option in the Keep Alive Response message. The Coordinator verifies that the key has been updated by reading the change in state of the selected key's Write Key Toggle Bit in the next Keep Alive Request. The process is repeated if the key has not been changed.

Eventually, all (or almost all) the devices have both the new key and the old key. Only the old key is used for transmission, but either the new key or the old key can be used for reception. The reception key selection is controlled by the DLL Security Header and the Network Security Header.

After all devices using the key have been updated and verified, the Coordinator tells the devices to start using the new key for transmission. The Coordinator waits for a Keep Alive Request message from a node using the new key as shown is FIG. 27. In the Keep Alive Response message, the Coordinator commands the node to switch to the new key for transmission. The switch is confirmed in the next Keep Alive Request message received from the device. After all the devices using the new key have switched, the Coordinator deactivates the old key by waiting for a Keep Alive Request and then sending a Keep Alive Response containing the appropriate key deactivate command. The Coordinator verifies the deactivation in the next Keep Alive Request received from the device. This process is used to update Node Keys, Maintenance Keys, and Mesh Keys. The Process for changing a generic Key x, version 0, is depicted in FIG. 26. Note that only the Coordinator is allowed to originate a Keep Alive Response message with key control commands in it.

An End Device's association to the network is similar to that of a regular Node (see Association). The only difference is that after the End Device has selected a Coordinator, it usually also needs to choose a Router to help with message forwarding. FIG. 28 shows a new End Device, Node-A, requesting neighbor information and receiving. In this example there are two PANs and three neighbors. Based on the Association Ratio algorithm, Node-A selects the Coordinator on PAN 1. It also selects Node-B as its Parent using the Parent Selection algorithm. Node-A then sends Node-B an Association Request message, which Node-B converts to an Association Confirmation Request message addressed to the Coordinator. The Coordinator sends the Association Confirmation Response message back to Node-B. Node-B then sends the Association Response message to Node-A. Node-B adds Node-A to its End Device Table after receiving a Keep-Alive Request message from Node-A with the “Device Type” set to End Device type and the Receiver On When Idle bit reset (to off). This first Keep-Alive Request message also carries the Multicast Group Addresses list which is captured by Node-B for future filtering and forwarding of Multicast messages. The Coordinator receives the Keep Alive Request message. A Parent can remove a Node form its End Device Table if it has not received any Keep Alive Request messages from this Node for a period exceeding 24 hours.

When an End Device loses connectivity with its Parent (i.e. after a number of unsuccessful attempts to communicate determined by the ROUTE_LOST_ATTEMPTS parameter), it tries to find another Router on the same network. The End Device sends a Neighbor Info Request on the current channel and uses the Parent Selection algorithm to choose its new Parent. Then it sends a Keep Alive Request to inform both the Parent and the Coordinator of this change. The processes of re-associating with the Coordinator and a new neighbor are shown in FIG. 29. The End Device, Node-A, fails to communicate through Node-B and, after a number (ROUTE_LOST_ATTEMPTS) of attempts it broadcasts a Neighbor Info Request to Nodes on the same channel and PAN. It then selects the best neighbor with which to associate. In this case Node-E is selected. It then sends a Keep Alive Request message to the Coordinator though Node-E. The Coordinator returns a Keep Alive Response message.

Message forwarding with a non-sleeping End Device is done as soon as received. Referring to FIG. 30, a Non-sleeping End Device advertises its presence to its Parent and to the Coordinator in both the Association Request and the Keep Alive Request messages. In both of these messages, the Device Type field is set to End Device type and the Receiver On When Idle is set.

In the case of transmission by the Sleeping End Device, the Parent allows the End Device to return to sleep as soon as the transmission acknowledgment (802.15.4 ACK MAC-PDU) for the message is received. All frames sent to a Sleeping End Device (unicast, multicast and broadcast) are buffered by its Parent and transmitted to it when it is awake. If a response is expected, a Sleeping End Device wakes up every RESP_SLEEP_PERIOD until the expected response is received. If no response is expected the Sleeping End Device sleeps for the interval SLEEP_CHECK_PERIOD. The Sleeping End Device wakes up periodically at each SLEEP_CHECK_PERIOD to check for buffered frames. It also wakes up when it has a message to transmit. When it wakes up with a message to transmit it first checks for buffered frames before it transmits its own message.

The Sleeping End Device frame forwarding process is illustrated in FIG. 31. The sleeping Node-A wake ups and checks for any frames buffered in Node-B by sending an End Device Data Request message. Node B replies with an End Device Response message with the “no Frame Pending” status that tells Node-A there are no frames buffered. Node-A then transmits a frame that does not require a response to a target application through its Parent, Node-B. Node-A waits for an ACK MAC-PDU from Node-B and then goes to sleep for SLEEP_CHECK_PERIOD. This sleep is interrupted when Node-A wakes up to transmit another frame. The new frame is a request that requires a response from the target. The request frame is routed to the target by Node-B. When Node-A receives the MAC level ACK from Node-B, it restarts its sleep timer with a duration set to the value of RESP_SLEEP_PERIOD. Node-B forwards the request frame to the target application that then generates a response frame. Node-B receives and buffers the response frame for Node-A which is sleeping. Node-A wakes at the end of the time period and sends Node-B an End Device Data Request message and receives an End Device Response message with the Frame Pending bit set. Node-A waits for the stored frame for a maximum duration of MAX_MF_WAIT. If it does not receive a frame during this time interval, it resends the End Device Data Request message. In FIG. 31, Node-B sends the response frame in its buffer to Node-A before the MAX-MF_WAIT_PERIOD. Node-A sends Node-B an ACK MAC-PDU and goes back to sleep with the timer duration set to the value of SLEEP_CHECK_PERIOD. Node-B releases the buffer when it receives the ACK MAC-PDU from Node-A.

Sleeping End Device wakeups periodically to verify a message is pending. Each SLEEP_CHECK_PERIOD the Sleeping End Device sends an End Device Data Request frame to its Parent and waits a predefined time, DATA_REQUEST. TIMEOUT, listening for pending frames before returning to sleep. FIGS. 32 and 33 show the Sleeping End Device Checkpoint process. In FIG. 32 a message is received for Sleeping End Device, Node-A, and buffered by the Parent Node-B. Node-A wakes when its Checkpoint timer expires. It sends an End Device Data Request message to Node-B and receives an End Device Data Response message with the frame-pending bit set. Node-A then starts its listen timer with a duration of DATA_REQUEST_TIMEOUT and listens for a frame from Node-B. Node-B sends the buffered frame to Node-A, which stops the listen timer. The frame does not have the frame-pending bit set, which tells Node A that there are no more frames to receive. Node-A sets the Checkpoint timer with the duration CHECKPOINT_PERIOD and goes back to sleep. Node-B releases the buffer when it receives the ACK MAC-PDU frame from Node-A.

In FIG. 33, Node-A wakes up when its Checkpoint timer expires. In this case Node-B has no frame stored for Node-A, so when Node-A sends the End Device Data Request message Node-B's replying End Device Data Response message does not have the frame-pending bit set. Node-A sets its Checkpoint timer with the CHECKPOINT_PERIOD and goes back to sleep.

This process exemplified in FIG. 34 is used to initiate a point-to-point communication with a Sleeping End Device. Typical applications for this type of communication are between a handheld device and a sleeping End Device and occur during installation, operation, and maintenance processes. A physical trigger (button, reed switch+magnet) initiates Local Communication. This sets the Sleeping End Device in local communication mode. The Sleeping End Device then sends an End Device Node Present message with a periodicity of END_DEVICE_PERIOD and listens for the interval END_DEVICE_WAIT for any command sent in response. This process stops and the Sleeping End Device goes to sleep if it has not communicated with a local device in the interval determined by the END_DEVICE_INACTIVITY_TO parameter. Once a communication is initiated with a local device, the Sleeping End Device stays in the local communication mode for the time interval determined by the END_DEVICE_INACTIVE_TO parameter after each frame is received or transmitted.

In FIG. 34, a Sleeping End Device, Node-A, receives an external trigger that puts it in a mode where it looks for a local device with which to communicate. It transmits an End Device Node Present frame and starts two timers. The first timer is the end device notification timer, END_DEVICE_PERIOD, which determines how long the Sleeping End Device listens for a response to the notification message. The second timer is the end device notification process timer. It determines how long the Sleeping End Device remains in the state where it is looking for a local device. In FIG. 34. Node-A sends one End Device Node Present message that is not heard by the local device. After the end device notification timer expires, it sends a second End Device Node Present message that triggers a second response by the local device. The ACK MAC-PDU from the local device terminates the two timers and puts Node-A in the local communication mode. In this mode Node-A starts the end device communication timer that is set with a duration specified by the LOCAL_COM_TO parameter. During the first timer period the local device sends Node-A a frame that resets the timer. During the second timer period Node-A initiates a frame of its own to the local device. This transmitted frame also resets the timer. There is no communication during the third period other than the ACK MAC-PDU from the local device. The ACK MAC-PDU does not reset the timer, which then expires, causing Node-A to exit from the local communication mode.

The concept of Dedicated Routers allows the deployment of multiple Coordinators at the same physical location. This approach consists of deploying multiple Routers, possibly with directional antennae, where each Router is dedicated to a specific mesh network/Coordinator. A Dedicated Router has the following specific behavior: a Dedicated Router is associated to a specific Network Name and is manually configured with this name and a Dedicated Router can associate only to the Coordinator or another Dedicated Router; it is not allowed to associate with a normal (non-dedicated) Router. This restriction is imposed to avoid the situation where a Dedicated Router works for some time until its environment changes in such a way that it is no longer capable of establishing a route to its Coordinator. For the computation of the association ratio, a Dedicated Router is seen as a no-hop-distant device similar to a Coordinator. This guarantees that surrounding devices will prefer the Dedicated Router over other Routers for their association. Dedicated Router sets the Dedicated Router Flag in the Neighbor Info Response message. Nodes receiving Neighbor Info Response message with the Dedicated Router Flag set shall consider it to be as a no-hop-distant device when computing its Association Ratio.

The following mechanisms are provided to control the flow of messages on the network and to provide some control on message latency. Most traffic is either sent from or to the Coordinator. Message latency is directly affected by the way the Coordinator manages this traffic. Internally, the Coordinator orders messages based on the importance of the associated task and the notion of priority implemented by the application layer. In the case of the ANSI C12.22 application layer, this notion of priority takes the form of the URGENT flag carried in the Calling AE Qualifier element. To control traffic flow in the reverse direction, the protocol allows the Coordinator to control the timing of the Checkpoint process at each Node. To do this, the Coordinator sends a Keep Alive Initiate message to each Node before the end of that node's CHECKPOINT_PERIOD. Frames routed within the mesh network have an Urgent flag, which when set permits the Router to reorder outbound frames when there are other frames of lesser priority in the transmit queue. Nodes are not permitted to use the entire network capacity for any extended period of time. In the network protocol, this throttling is provided by a single-frame transmission window with an end-to-end acknowledgment.

A mesh forwarding process is required for support services that are used before a Node has associated with a network. This forwarding process allows the unassociated Node to communicate with service hosts such as commissioning or location tracking hosts on a LAN or WAN segment. The commissioning process is implemented by the application. The secure mesh protocol does not determine how commissioning is done, but it does support over-the-network commissioning using the Service and Service Forwarding messages. When used, these messages convey the Node Key and Maintenance Key that will be used by the device so that it is able to run the Association processes. Alternatively, the device could be commissioned with these keys during manufacturing.

The forwarding process is illustrated in FIG. 35. The requesting device issues a Neighbor Info Request frame and listens for Neighbor Info Response frames. This is the same process used when the device associates with the network. The neighbor information process is shown in FIG. 3. The device uses the Association Algorithm to pick the neighbor to use as a proxy for service message forwarding. The requesting device, Node-A, places the service message in a Service Request frame addressed to the selected neighbor, Node-B. The Service Request frame identifies the service the message is to go to in the mesh header in the “Server” field. The Service Request frame is then transmitted to Node-B. Node-A starts a “halt service request timer” when the MAC ACK is received from Node-B. This timer is set with the parameter SERVICE_PERIOD that prevents Node-A from sending more service frames until the timer has expired.

Node-B recognizes the Service Request frame from its “service type” and “service code” fields. It processes the frame by assigning the forwarding process for Node-A a “Requestor id” value and sending the contained information to the Coordinator in a Service Forwarding frame. Node-B starts a “halt service request RX timer” when it successfully transmits the Service Forwarding frame. The timer is set with the SERVICE_PERIOD parameter. While the timer is active, Node-B does not accept additional Service Request frames from any Node, including from Node-A.

The SERVICE_PERIOD timeout set by both Node-A and Node-B is cancelled as soon the service host accepts servicing the request as indicated by an appropriate service reply. The SERVICE_PERIOD timeout is reestablished for each new Service Request frame that is sent.

The Coordinator receives the Service Forwarding frame from Node-B. It registers the “Requestor ID” value and Node-B's address. The Coordinator sends the service message contained in the Service Forwarding frame to the service host identified in the “Server Requested” field. When the service host responds, the Coordinator puts the service message in a Service Forwarding Reply frame and addresses it to Node-B. The Coordinator also fills in the “Requestor id” value for Node-A. The Coordinator sets a “Service keep-alive timer” that will release the forwarding process if it is inactive for the duration SERVICE_TO. Releasing the forwarding process for Node-A removes the Node-A's “Requestor id” from memory.

Node-B receives the Service Forwarding frame from the Coordinator and looks up the “Requestor id” to identify Node-A as the destination. The receipt of the Service Forwarding frame sets Node-B's “Service keep-alive timer” for the duration SERVICE . . . TO. If the timer expires before another Service Forwarding frame is received for Node-A, the Node-A “Requestor id” is released. Node-B constructs the Service Requestor response frame and sends it to Node-A.

Node-A receives the Service Requestor response frame and extracts the host's service message. The receipt of the Service Requestor response frame sets Node-A's “Service keep alive timer” for the duration SERVICE_TO. If Node-A does not receive another host message in this time, it times out the service-request process. If later there is another message generated to a host, the service-request process is restarted from the beginning with a new Neighbor Info Request frame.

Every Node in the mesh network can notify the Coordinator rapidly after it loses power or when the power is restored. The performance goal for the process is to have most Nodes notify the Coordinator within one minute after their status changes. Those Nodes that take longer should not exceed the three minutes of backup power provided by the Nodes implementing the Power Outage Routing option as advertised by the Neighbors Exchange service. The system load induced by this process is a critical consideration because every Node may need to communicate in a very short time. Power event report aggregation and low overhead tree routing are employed to reduce the amount of system communication capacity used for this reporting.

FIG. 36 shows the overall process used by a Node to report a power event. The process starts with a Node detecting a power event and waiting to make sure it is not a transient. For an event to be reported, it has to last more than the time defined by the PO_RECONGNITION_PERIOD parameter.

Any Node that has a power event that passes this transient-suppression test goes into the PO_AGGREGATE_PERIOD round. The leaf Nodes—Nodes without any Children in their Neighborhood Table—and first hop Nodes report their event in this round. To distribute these transmissions more uniformly, each reporting Node transmits at a pseudo-randomly-chosen time within the interval whose duration is PO_AGGREGATE_PERIOD. Nodes receiving events during this interval aggregate these events for later transmission. At the end of the PO_AGGREGATE_PERIOD round, Nodes enter the PO_RND_PERIOD round. Event Nodes that have event reports to send schedule transmission at a pseudo-randomly chosen time within this interval. During this interval, non-aggregating Nodes are free to piggyback their event report to any of the Power Event Report frames that they may route; however, aggregating Nodes must initiate their own Power Event Report frame since the eventual acknowledgment they receive for the forwarded aggregated event reports needs to be broadcast to the aggregator's neighbor Nodes.

The Coordinator receives power event reports and sends acknowledgements. These event acknowledgements follow a source route constructed from the entries in the Power Event Report. Because of this, the acknowledgement message follows the reverse route of the report and confirms the reception to each Node reporting an event. When the target Node is not the last Nodes in the reporting list within the Power Event Report, the target address is set to the broadcast address (=0xFFFF). The broadcast address allows leaf Nodes to be acknowledged using a broadcast at the end of the source route path. Reporting Nodes that do not receive an acknowledgement from the Coordinator at the end of the PO_RND_PERIOD round enter into a PO_RETRY_RND_PERIOD round.

Each such Node schedules a transmission time pseudo-randomly within the following interval of duration PO_RETRY_RND_PERIOD. This round is repeated until the event report is acknowledged or the backup power is exhausted. Nodes acknowledged prior to a scheduled power event reporting transmission do not initiate that transmission, even if they had entered into the retry round. Nodes reporting a power event do not initiate any Data Transfer messaging of their own while they are in any of the power event reporting rounds. All event Nodes continue to route the messages they receive.

FIG. 37 shows an example of the power outage reporting for a non-leaf Node that is multiple hops away from the Coordinator. Node-A detects a power outage and waits for the time given by PO_RECOGNITION_PERIOD to confirm that the outage is not a transient. Node-A stops initiating Data Transfer messages and does not resume until power is restored. After the recognition interval, Node-A waits for an interval given by the parameter PO_AGGREGATION_PERIOD to collect events from neighboring Nodes. While in the aggregation state, Node-A does not forward Power Event Report frames to the Coordinator unless the message contains event reports from multiple Nodes. At the end of the aggregation state, Node-A enters into the PO_RND_PERIOD round. Node-A delays for a pseudo-randomly chosen time within the interval of duration PO_RND_PERIOD before sending a Power Event Report frame. If Node-A needs to route a Power Event Report frame during this delay and has no events aggregated, it piggybacks its own report and sends the resulting frame to the next hop.

At the end of the delay, if Node-A was not able to piggyback its event, it initiates its own Power Event Report frame including any additional aggregated events.

After sending or piggybacking its event report, Node-A expects an acknowledgment from the Coordinator. In FIG. 37, Node-A receives this acknowledgement and so it does not enter into a retry state at the end of the current round. Even though Node-A does not go into a retry round, it continues to route messages until its backup power is exhausted.

FIG. 38 depicts the process in which Node-A fails to get an acknowledgement for a power event report and has to retransmit the report. The actions taken by Node-A are the same as those in the failure-free case shown in FIG. 37 until the acknowledgement from the Coordinator is lost in the PO_RND_PERIOD round.

At the end of the round, Node-A goes into a retry round. The retry round lasts for the time determined by the PO_RETRY_RND_PERIOD parameter. Node-A selects its retry transmit time pseudo-randomly within the period and resends a power event report containing its address. Node-A does not have to originate a retry frame if it has an opportunity to add its event report to a routed Power Event Report frame while in the retry round.

An example of power event reporting for a Node that is one hop from the Coordinator is shown in FIG. 39. Node-B is a neighbor of the Coordinator. One-hop Nodes can transmit their reports to the Coordinator in the PO_AGGREGATE_PERIOD round. Node-B transmits the power event report after a pseudo-randomly-chosen delay and receives an acknowledgement. If the acknowledgement were not received, the Node would retransmit the event report in the following PO_RND_PERIOD round.

Leaf Nodes transmit their reports during the PO_AGGREGATE_PERIOD round. FIG. 40 shows a typical leaf Node power event reporting process. A Leaf Node, Node-C, chooses a pseudo-random time within the interval of duration PO_AGGRETATE_PERIOD to transmit its power event report. The acknowledgement for this report may not be received until near the end of the interval of duration PO_RND_PERIOD. In this case Node-C receives the acknowledgement and its power event reporting process is completed. If an acknowledgement is not received, Node-C enters an interval of duration PO_RETRY_RND_PERIOD and retransmits the event report. This continues until Node-C runs out of backup power or an acknowledgement is received.

Tree routing is normally used to send power outage/restoration event notification frames. Mesh routing may also be used as an alternate method if the Node has been waiting to send its event for more than the time set by the parameter POWER_REPORT_WAIT.

Power restoration reporting uses the same process and messaging as power outage reporting, except that the parameters PO_RND_PERIOD and PO_RETRY_RND_PERIOD are replaced by the parameters PR_RND_PERIOD and PR_RETRY_RND_PERIOD. For Nodes that are members of overlapping networks, power outage and power restoration notifications may be done to any of the registered networks. Different Coordinators are selected in round-robin fashion at each attempt of reporting a notification. Attempts to send power restoration notifications are repeated up to the duration RESTORATION_TIMEOUT. Nodes that are not members of overlapping networks initiate an Association process after waiting an interval whose duration is RESTORATION_TIMEOUT. After a successful Association, the associating Nodes do not need to send Power Event Report messages since the Association process itself sets the Coordinator's state for the Node to “Alive.”

A mesh multicast service is used to send application level information to a group of Nodes that share the same group address. A group address is a 2-octet short address within the range 0x×3000 to 0x3FFF. Group addresses are well known or configured, with well known addresses assigned from address 0x3FFF and decreasing while configured addresses are assigned from address 0x3000 and increasing. The mesh layer does not provide services to configure group addresses; such assignment needs to be made by the application layer from a centralized location such as the Coordinator.

A Mesh multicast service consists of a local broadcast by the originator of the multicast message. Each Router receiving this message verifies: that the message has been received from an authenticated Node listed in its Neighborhood table; and that the message Originator address and Request ID do not match those of a previously processed message. The Router then verifies that the Target Address matches one of its own group addresses. If a match is found, the message is propagated to the Router's upper layers for processing. The Router also determines whether the Target Address matches a group address of its child End Devices. If so, the message is sent to each child End Device having a matching group address. A copy of the message is saved for each Sleeping End Device with a matching group address.

Child-group-addresses are acquired by a Parent Router by inspecting the first Keep Alive Request message sent by each child End Device after the End Device chooses or changes its primary parent. Routers do not forward group-addressed frames to End Devices for which they are not primary parents.

Multicast Data Transfer frames with a Max Remaining Hops field greater than one are re-broadcast. To re-broadcast a message the Router first decrements the Max Remaining Hops field and broadcasts the resulting message to its own neighbors. Duplicate multicast messages are ignored based on the messages' Originator address and Request ID as specified previously.

The Max Remaining Hops field can be used to limit the region for which a multicast is sent. To target all Nodes within the network, a Coordinator should set the Max Remaining Hops field to the value MAX_HOPS. To achieve the same result for frames from a different source, a non-Coordinator Node should set the Max Remaining Hops field to twice the value MAX_HOPS. All SM nodes in a group have the well known group address shown in Table 5.

TABLE 5 Well known group addresses Address Group 0x3FFF All SecureMesh Nodes

A simple example of the mesh multicast process is shown in FIG. 41. Node-X initiated the multicast data transfer, which progressed through the mesh network until it reached Node-A and Node-B, where Node-A is a neighbor of Node-B and Node-C, and Node-C is a neighbor of Node-D, but Node-B is not a neighbor of Node-C. Node-A receives the Multicast Data Transfer frame and checks the Originator Address and Request ID. Because it appears to be a previously-unreceived multicast frame and the value of the Max Remaining Hops field is greater than one, Node-A forwards the frame after decrementing the value of the Max Remaining Hops field. The forwarded frame goes to Node-B and Node-C. Both Node-B and Node-C also forward the frame to their neighbors. The frame forwarded by Node-C goes to Node-D where it is not re-forwarded because the value of the Max Remaining Hops field in the received frame equals one. At a later time, Node-B receives the multicast frame via another route. This duplicate frame carries the same Originator Address and Request ID as the prior frame, so it is discarded and not forwarded.

The local communication process is used to initiate point-to-point communication between two Nodes that may not already be part of the same mesh network. Typical applications that use this type of communication are installation, operation and maintenance activities and walk-by reading of Nodes using a handheld reader. Local communications use the Node's long 8-octet IEEE EUI-64 address rather than its short 2-octet address. In the cases of walk-by communication with targeted devices that are not sleeping, the handheld device issues the Local Broadcast Request frame to initiate local communication. From the responses to this local broadcast, the handheld device can build a table of local devices that are awake, where each table entry includes the following information about the responding Node: long and short addresses;

PAN IDs; Device Class information; and optionally Network Name, security flag, VERSION, OWNER, and BAR_CODE_ID.

From this resulting acquired table of device information, the user can select the device with which to communicate. There are two local communication options: 1) local data transfers that use the application level services using Local Data Transfer frames, and 2) RF link measurements using the Range Test Request and Range Test Response frames.

FIG. 42 shows a typical local communication sequence. The handheld device discovers the local nodes by transmitting a Local Broadcast Request frame. This message is answered by Node-A and Node-B. The handheld application selects Node-A and sends it a Local Data Transfer frame that executes an application service such as a read operation. Node-A responds with a Local Data Transfer frame containing the application response. All frames except the first broadcast frame are acknowledged with MAC-level ACKs.

The Range Test process uses the local communication Range Test Request and Range Test Response frames. The Range Test Request command frame is used to check whether Node is reachable in the local communication mode. The Range Test Response frame reports the signal strength as recorded by the responder in the forward direction. The signal strength of the response is measured by the range test originator to determine signal strength in the return direction. The Range Test Initiate and Range Initiate Result frames can be used to request one Node to perform a range test with a different Node and to report the test results to the requester. A typical example of this function is for a handheld test tool to request a Router to do a range test with an End Device.

FIG. 43 shows this process, where a handheld device requests Node-A to perform a range test with Node-B. The Range Test Initiate sent to Node-A tells it to send a Range Test Request to Node-B. Node-B receives the request and records its modem's RSSI and LQI values as measured during request frame reception. Node-B then sends a Range Test Response to Node-A, which records its modem's RSSI and LQI values as measured during response frame reception. Node-A then sends a Range Test Result to the handheld device, reporting the RSSI and LQI values for both the Range Test Request and Range Test Response frames between Node-A and Node-B.

The FRR test is used to evaluate the one-way link quality between a sender and a receiver. Theses two Nodes need to be able to reach each other directly. The sender sends a configurable number of frames in local communications mode to the receiver. At the end of the test, the receiver sends a result frame to the sender. This frame contains the FRR and the average LQI for received frames. A frame reception rate session consists of: the transmission of the Frame Reception Rate Test Init message; multiple transmission of the Frame Reception Rate rest Data messages; the transmission of the Frame Reception Rate Test End message; and the reception of the Frame Reception Rate Test Result message.

With the exception of the Frame Reception Rate Test Data messages, Frame Reception Rate Test control messages are transmitted with MAC layer acknowledgment and retry. In the case of a MAC layer transmission failure, such control messages are re-transmitted up to a maximum of FRR_TEST_RETRY times.

An example of the frame reception rate test process is shown in FIG. 44. A handheld initiates the test in this example by sending the Frame Reception Rate Test Init message to Node-A. The test is set to send N test frames without acknowledgements. The handheld starts sending the first of the N test frames to Node-A after it receives the ACK from Node-A for the test-initializing message. The Frame Reception Rate Test End message is sent after the N test frames. The test end message is acknowledged by Node-, which then sends the Frame Reception Rate Test Result v to the testing handheld.

The ping command is used to check whether a Node is reachable through the mesh network, and to determine and trace the routes used for each direction of communication. The Ping frame tests the ability of a device to reach a Node that is more than one hop distant, since testing of the first hop is provided by Range Test commands. A Ping Request can be used by a Coordinator to determine whether a device that is awake is reachable in the intervals between Keep Alive Requests. The Ping Request frame can be used with any type of routing. As the frame traverses each Node, the RSSI and LQI values measured during frame reception are noted. Both values are added to the frame before it is forwarded. The addressed receiving device processes the Ping Request frame, converts it to a Ping Response frame, and sends that response back to the originating device. The RSSI and LQI values measured during frame reception on the return path are appended to those accumulated as the Ping Request frame traversed its forward path.

In FIG. 45, Node A initiates a Ping Request message targeting Node-C. The frame within the Ping Request message is routed through Node-B. Node-B updates the frame data by incrementing the hop count, and appending its 2-octet address, the measured RSSI and the observed LQI to the Ping Request frame's accumulated data before forwarding the frame to Node-C. Node C converts the received Ping Request frame to a Ping Response frame and sends it to Node-A. When the Ping Response frame arrives at Node-A, it contains the path traversed by the request and response frames and the measured RSSI and observed LQI values noted at each hop.

The SM frame structure is presented so that the leftmost or first-described field is transmitted or received first. Except for octet arrays, all multi-octet fields are transmitted or received least significant octet first. To maintain compatibility with the IEEE 802 standards, addresses and PAN identifiers are considered octet arrays and are transmitted unaltered, which is equivalent to transmitting them most significant octet first when viewed as multi-octet fields.

Each frame described in this document includes MAC layer fields, which are documented within the mesh layer to provide the context on which the mesh layer operates. The MAC and mesh layers are tightly coupled, so that information required by the mesh layer that is already present at the MAC layer is not duplicated. Descriptions of the MAC layer fields are provided in this subsection so that they need not be duplicated in the description of each mesh-layer frame format. More information on these fields can be found in the IEEE 802.15.4:2006 standard, which is the controlling specification for the MAC protocol and is incorporated herein by reference in its entirety.

TABLE 6 MAC Layer Fields Field Name Data type Description Frame Control Unsigned 16 bits See sub fields below: Frame Type Bits 2-0 One of the following frame types: 0 = Beacon 1 = Data 2 = MAC acknowledgment 3 = MAC command Security Enabled Bool 3 Set if the frame is cryptographically protected by the MAC layer as specified in IEEE 802.15.4: 2006. This bit is reset in the SM protocol. Frame Pending Bool 4 Set if the Router sending the frame has additional data frames to send to the targeted End Device following the current transfer. If another frame is pending, the End Device retrieves it by sending another Data Request command to the acknowledging Router. Ack. Request Bool 5 Specifies whether an acknowledgment is required from the recipient device on receipt of a data or MAC command frame. Intra-PAN Bool 6 Specifies whether the MAC frame is to be sent within the same PAN (intra-PAN) or to another PAN (inter-PAN). When set and both destination and source addresses are present, the frame contains only the destination PAN identifier field. Destination Addressing Mode Bits 11-10 Specifies the presence and format of the destination address: 0 = PAN identifier and address not present. 2 = 2-octet short address present. 3 = 8-octet EUI-64 extended address present. Source Addressing Mode Bits 15-14 Specifies the presence and format of the source address: 0 = PAN identifier and address not present. 2 = 2-octet short address present. 3 = 8-octet EUI-64 extended address present. Sequence Number Unsigned 8 bits Specifies a unique sequence identifier for the frame. When the SM MAC Header Flag is 0: for a data, acknowledgment, or MAC command frame, the sequence number field is used to match an acknowledgment frame to the data or MAC command frame as specified in the IEEE 802.15.4: 2006 standard. When the SM MAC Header Flag is set to 1: the Sequence Number is the least significant octet of the MAC nonce counter, Destination PAN Identifier Binary 2 octets Specifies the unique PAN identifier of the intended recipient of the frame. A value of 0xFFFF in this field is the broadcast PAN identifier, which is accepted as a valid PAN identifier by all devices currently listening to the channel. Presence of this field is defined by the Destination Addressing Mode field. Destination Address Binary 2 octets Specifies the address of the intended recipient of the frame. A value of 0xFFFF in this field represents the broadcast short address, which is accepted as a valid short address by all devices currently listening to the channel. Presence and content of this field is defined by the Destination Addressing Mode field. Source PAN Identifier Binary 2 octets Specifies the unique PAN identifier of the originator of the frame. This field is included only if the Source Addressing Mode and Intra-PAN subfields of the frame control field are nonzero and zero, respectively. Source Address Binary 2 octets Specifies the address of the originator of the frame. Presence and content of this field is defined by the Source Addressing Mode field. FCS Unsigned 16 bits 2-octet ITU-T CRC as specified by IEEE 802.15.4, without the initial preset or final complementation typical of a frame check sequence (e.g., as in IEEE 802.3).

Bits 4 to 6 of the first octet of the Mesh header are called the Service type. This field defines the structure of the next of the mesh header and the general behavior of a group of messages. With the exception of the Data Transfer frame, the subsequent header prefix contains a field called Service Code which defines the specific message format for the last of the mesh header. Table 7 enumerates all defined combinations of Service Type and Service Code.

TABLE 7 Defined Service Type and Service Code Combinations Service Service Type Service Code Data transfer Data Transfer 0 <none> Route discovery Route Request 1 1 Route Reply 1 2 Route Error 1 3 Routed services Association Confirmation Request 2 0 Association Confirmation Response 2 1 Keep Alive Initiate 2 3 Keep Alive Request 2 4 Keep Alive Response 2 5 Route Establishment Request 2 6 Route Establishment Response 2 7 Power Event Report Notification 2 8 Power Event Report Acknowledgment 2 9 Ping Request 2 10 Ping Response 2 11 Service Forwarding Request 2 12 Service Forwarding Response 2 13 Non routed service Association Request 3 0 Association Response 3 1 Neighbor Info Request 3 2 Neighbor Info Response 3 3 Neighbors Exchange 3 4 End Device Data Request 3 5 End Device Data Response 3 6 Service Request 3 7 Multicast data transfer Mesh Multicast 4 <none> Point to point communication Local Data Transfer 5 0 Frame Reception Rate Test Init 5 1 Frame Reception Rate Test Data 5 2 Frame Reception Rate Test End 5 3 Frame Reception Rate Test Result 5 4 Local Broadcast Request 5 20 Local Broadcast Response 5 21 End Device Node Present 5 22 Range Test Request 5 30 Range Test Response 5 31 Range Test Initiate 5 32 Range Test Result 5 33

The following table defines which message is implemented for the supported devices.

TABLE 8 Message supported per Node Type End Coordi- Rout- End Hand- Message point nator er Device held Data transfer Originator Y Y Y Target Y Y Y Mesh Multicast Originator Y Y Y Target Y Y Y End Device Data Originator Y Request Target Y End Device Data Originator Y Response Target Y Association Request Originator Y Y Target Y Association Response Originator Y Target Y Y Association Originator Y Confirmation Request Target Y Association Originator Y Confirmation Response Target Y Neighbor Info Originator Y Y Request Target Y Y Neighbor Info Originator Y Y Response Target Y Y Neighbors Exchange Originator Y Y Target Y Y Route Request Originator Y Y Target Y Y Route Reply Originator Y Y Target Y Y Route Error Originator Y Y Target Y Y Keep Alive Initiate Originator Y Target Y Keep Alive Request Originator Y Y Target Y Keep Alive Response Originator Y Target Y Y Route Establishment Originator Y Y Request Target Y Route Establishment Originator Y Response Target Y Y Power Event Report Originator Y Y Target Y Ping Request Originator Y Y Y Target Y Y Y Ping Response Originator Y Y Y Target Y Y Y Service Request Originator Y Y Target Y Y Service Forwarding Originator Y Y Target Y Y Local Broadcast Originator Y Request Target Y Y Y Local Broadcast Originator Y Y Y Response Target Y End Device Node Originator Y Y Y Present Target Y Local Data Transfer Originator Y Y Y Y Target Y Y Y Y Frame Reception Originator Y Rate Test Init Target Y Y Y Frame Reception Originator Y Rate Test Data Target Y Y Y Frame Reception Originator Y Rate Test End Target Y Y Y Frame Reception Originator Y Y Y Rate Test Result Target Y Range Test Request Originator Y Target Y Y Y Range Test Response Originator Y Y Y Target Y Range Test Initiate Originator Y Target Y Y Y Range Test Result Originator Y Y Y Target Y

This message frame format shown in FIG. 46 is used to transport upper layers information for all requests and responses.

TABLE 9 Fields (Tree and Mesh routing) Field Name Data type Description Common MAC See description herein. layer fields Unsigned See sub fields below: 8 bits Source Route Bool 7 Reset Present Service Type Bits 6-4 Set to 0 Urgent Bool 3 Set when the message is urgent and should be forwarded immediately before any other less-urgent pending transmission. PAN Bool 2 Set when the Target PAN Identifier and present the Originator PAN Identifier are added to the frame to identify the network of the target Node. DLL Bool 1 Set when the DLL Security Header follows Security this octet Header Flag Network Bool 0 Reset, no Network Security Header follows Security Header Flag [DLL Unsigned See description herein. Security 16 bits Header] Unsigned See sub fields below: 8 bits Sibling Bool 7 Set when a frame is transmitted using Transmission tree routing and if a local repair is done though a Sibling instead of a Parent. Only one Sibling transmission is allowed per tree level; when a Node receives a frame with this flag set, it can only route this frame to one of its Parents. Max Unsigned Set to MAX_HOPS by the originator of Remaining bits 6-0 this message and decremented each time a Hops message is routed. The message is discarded and not forwarded when this value reaches zero and the next hop does not match the Final Destination Address. Target Binary Short address of the final target (Router Address 2 octets or End Device) of this message. Originator Binary Short address of the originator (Router Address 2 octets or End Device) of this message. Target Binary PAN identifier of the target Node as PAN 2 octets identified by the Target Address field. Identifier Originator Binary PAN identifier of the originator Node PAN 2 octets as identified by the Originator Address Identifier field. Payload Multi- Upper layer information. octet [DLL Binary See description herein. MIC32] 4 octets

TABLE 10 Fields (Source routing) Field Name Data type Description Common MAC See description herein. layer fields Unsigned See sub fields below: 8 bits Source Route Bool 7 Set Present Service Type Bits 6-4 Set to 0 Urgent Bool 3 Set when the message is urgent and should be forwarded immediately before any other less-urgent pending transmission. PAN present Bool 2 Reset for source routed messages. DLL Security Bool 1 Set when the DLL Security Header follows Header Flag this octet Network Bool 0 Reset, no Network Security Header follows Security Header Flag [DLL Unsigned See description herein. Security 16 bits Header] Unsigned See sub fields below: 8 bits Sibling Bool 7 Reset Transmission Max Unsigned Set by the Originator to the value of the Remaining bits 0-6 Number of Hops field and decremented at Hops each hop. This field is used to index to the next hop in the Hop Addresses list. This field is set to zero when the next hop corresponds to the Target Address. Target Binary Short address of the final target (Router Address 2 octets or End Device) of this message. Bits 15-14 define the network membership: 0 = The Node is part of the network with the PAN identifier specified by the first entry in the PAN Identifiers list. 1 = The Node is part of the network with the PAN identifier specified by the second entry in the PAN Identifiers list. 2 = The Node is part of the network with the PAN identifier as specified by the third entry in the PAN Identifiers list. 3 = The Node is part of a network which is not listed in the PAN Identifiers list. When this option is used, the frame can be routed to the incorrect Node in the following circumstances: More than four networks exist within the same geographical area Multiple Neighbors exist with the same short address but on non-listed networks. Originator Binary Short address of the originator (Router or Address 2 octets End Device) of this message. Bits 15-14 define the PAN identifier of the network of which the target Node is a member. See the Hop Addressesfield (following) for more information on these 2 bits. Unsigned See sub fields below: 8 bits Number Bits 7-6 Defines the number of entries in the of PAN PAN identifiers field. identifiers Number Bits 3-0 Number of Addresses in Hop Addresses list. of Hops Source routing is used when the Target Addresses device is more than one hop away. There- fore the Number of hops is at least one. PAN Array of List of Network identifiers. Bits 15-14 Identifiers Binary of the different short addresses specified 2 octets within this frame reference this list. Each short address is explicitly asso- ciated with one of the three specified PAN Identifiers, or none of them. Hop Array of Short address of each Node responsible Addresses Binary for routing this message. Bits 15-14 2 octets define network membership of the Node as described by the PAN identifiers field. Payload Multi- Upper layer information. octet [DLL Binary See description herein. MIC32] 4 octets

The mesh multicast message format set forth in FIG. 47 facilitates multicast of application data to a group of Nodes within a mesh network. Group addresses need either to be pre-assigned or assigned by an upper layer. This layer does not provide services to remotely assign group address to Nodes.

TABLE 11 Mesh Multicast Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned See sub fields below: 8 bits Source Route Bool 7 Reset Present Service Type Bits 6-4 Set to 4 Urgent Bool 3 Set when the message is urgent and should be forwarded immediately before any other pending transmission. PAN Bool 2 Reset present DLL Bool 1 Set when the DLL Security Header follows Security this octet Header Flag Network Bool 0 Reset, no Network Security Header follows Security Header Flag [DLL Unsigned See description in section       . Security 16 bits Header] Max Unsigned Set by the originator and decremented Remaining 8 bits each time the message is re-broadcast. Hops The initial value represents the maximum number of router hops from the originator that this message will reach. To ensure the message will reach all Nodes on the network, this value should be set to MAX_HOPS if the originator is the Coordinator or two time MAX_HOPS if the originator is a Node. Target Address of the group targeted. Address Originator Binary Short address of the originator (Router Address 2 octets or End Device) of this message. Request ID Unsigned Unique number used to eliminate duplicated 8 bits message during a broadcast storm. Unsigned 8 bits Last Bit 7 Flag which indicate the last fragment Fragment of a fragmented multicast. Fragment Bits When a multicast is fragmented, each ID 0 to 6 fragment has a unique fragment number from 0 to n where n represent the last fragment which is identified by Last Fragment flag set to true. Payload Multi- Upper layer data. octet [DLL Binary See description herein. MIC32] 4 octets

The route request message is used to create a route to a target Node for peer to peer communication between two Nodes using mesh routing. The route request message format is shown in FIG. 48.

TABLE 12 Route Request Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned See sub fields below: 8 bits Service Type Bits 6-4 Set to 1 DLL Security Bool 1 Set when the DLL Security Header Header Flag follows this octet Network Bool 0 Reset, no Network Security Header Security follows Header Flag [DLL Unsigned See description in section 5.8.1. Security 16 bits Header] Max Unsigned See description in section 6.4. Remaining 8 bits Hops Target Binary Broadcast address (0xFFFF) Address 2 octets Originator Binary Address of the originator of this Address 2 octets Route Request. Service Code Unsigned Set to 1. 8 bits Unsigned See sub fields below: 8 bits Trace Bool 0 When set, the response contains the list Route Flag of hops used to route to the target Node. When this option is used, the network is not updated with the routing information; Routers do not create a route in their routing table. Min LQI Bits 2-1 Used to set a minimum link quality for Class each hop of the requested route. Before accepting this request, each Node validate that the LQI class corresponding to the Node from which this message have been received is better or equal to the value of this field. Hop Count Unsigned Use to count the number of hops from 8 bits the Requestor Address. Initially sent with a value of zero and incremented each time this request is received and re- broadcast. Request ID Unsigned Unique number used to eliminate dupli- 8 bits cated message during the broadcast storm. Requested Binary Node for which a route is requested. Address 2 octets Requestor Binary Originator of this Route Request. Address 2 octets Hop List Array of Address of each Node routing this Binary message. The size of this list is Hop 2 octets Count minus one. Present if the Trace Route Flag is set. Padding Binary For backward compatibility. 2 octets DLL Binary See description herein. MIC32 4 octets

The route reply message is sent in response to a Route Request and is given the format shown in FIG. 49.

TABLE 13 Route Reply Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned See sub fields below: 8 bits Service Type Bits 6-4 Set to 1 DLL Bool 1 Set when the DLL Security Header Security follows this octet Header Flag Network Bool 0 Reset, no Network Security Header Security follows Header Flag [DLL Unsigned See description herein. Security 16 bits Header] Max Unsigned See description herein. Remaining 8 bits Hops Target Binary Same as Requestor Address. Address 2 octets Originator Binary Same as Requested Address. Address 2 octets Service Code Unsigned Set to 2. 8 bits Unsigned See sub fields below: 8 bits Trace Bool 0 Return the same value as the Trace Route Flag Route Flag received in the Route Request. Requested Binary Node for which a route have been Address 2 octets requested. Requestor Binary Originator of the Route Request. Address 2 octets Hop Count Unsigned Number of hop between the Requestor 8 bits Node and the Requested Node. Set to 1 if the Requestor Node is a neighbor of the Requested Node [Hop List] Array of Address of each Node routing this Binary message. The size of this list is Hop 2 octets Count minus one. Present if the Trace Route Flag is set. [DLL Binary See description herein. MIC32] 4 octets

The route error message is sent out to inform surrounding Nodes that a route to a destination has fail and need to be invalidated. This message is sent as a broadcast frame with Hop Count set to 1. Each Node receiving this message, re-broadcast the Route Error if its route table shows that other Nodes use this Node as a route to the destination and must therefore be informed of the invalid route. The route error message format is shown in FIG. 50.

TABLE 14 Route Error Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned 8 bits See sub fields below: Service Type Bits 6-4 Set to 1 DLL Security Bool 1 Set when the DLL Security Header Header Flag follows this octet Network Bool 0 Reset, no Network Security Header Security follows Header Flag [DLL Unsigned 16 bits See description herein. Security Header] Max Unsigned 8 bits See description herein. Remaining Hops Target Binary 2 octets Broadcast address (0xFFFF) Address Originator Binary 2 octets Address of the Node generating Address this message. Service Code Unsigned 8 bits Set to 3. Hop Count Unsigned 8 bits Set to 0x01 Invalidated Binary 2 octets Short address [DLL Binary 4 octets See description herein. MIC32]s

All messages described within this subsection share the same MAC header and Mesh header prefix format. This common portion of the message is shown in FIG. 51.

TABLE 15 Common Routed Message Frame Fields Field Name Data type Description Common MAC layer fields See description herein. Unsigned 8 bits See sub fields below: Source Route Present Bool 7 See description herein. Service Type Bits 6-4 Set to 2. Urgent Bool 3 See description herein. PAN present Bool 2 See description herein. DLL Security Header Flag Bool 1 See description herein. Network Security Header Flag Bool 0 See description herein. [DLL Security Header] Unsigned 16 bits See description herein. [Network Security Header] Unsigned 40 bits See description herein. Unsigned 8 bits See sub fields below: Sibling Transmission Bool 7 See description herein. Max Remaining Hops Unsigned bits 0-6 See description herein. Target Address Binary 2 octets See description herein. Originator Address Binary 2 octets See description herein. [Target PAN Identifier] Binary 2 octets See description herein. [Originator PAN Identifier] Binary 2 octets See description herein. Unsigned 8 bits [Number of PAN identifiers] Bits 7-6 See description herein. [Number of Hops Addresses] Bits 3-0 See description herein. [PAN Identifier] Binary 2 octets See description herein. [Hop Address] Binary 2 octets See description herein. Specific message fields [Network MIC32] Binary 4 octets See description herein. [DLL MIC32] Binary 4 octets See description herein.

The association confirmation request message is sent to the Coordinator by a Router when an “Association Request” is received from a Node requesting an association. The association request message format is shown in FIG. 52.

TABLE 16 Association Confirmation Request Frame Fields Field Name Data type Description Common routed See description herein. message format Service Code Unsigned Set to 0. 8 bits Requesting Binary Long address of the Node requesting Node 8 octets the association. Address Embedded Association request information Embedded Binary Network Security Header of the embed- Net Security 5 octets ded Association Request, included only for secure association. Enabled only if “DLL Security Header Flag” and/or “Network Security Header Flag” are set. Unsigned Association information of the embed- 8 bits ded Association request, see sub fields below: Secure Node Bool 0 When reset, the device is not config- ured to associate to a secure network and the Embedded Net Security Header and Embedded Net MIC32 should not be processed. This option is possible only when the entire network is configured insecure. Secondary Bool 1 Set when the Node is already asso- Network ciated to a network and want to create secondary association with neighbor networks to allow overlapping network communications. Device Type Bool 2 Reset when the device is a Router and set when the device is an End Device. Receiver On Bool 3 Set if the End device does not disable When Idle its receiver to conserve power during idle periods. This field can be reset only if the Device Type is set. Embedded Network MIC32 of the embedded Asso- Net MIC32 ciation Request, included only for secure association.

The association confirmation response message is returned by the Coordinator to a Router in response to an Association Confirmation Request. The association confirmation response message format is shown in FIG. 53.

TABLE 17 Association Confirmation Response Frame Fields Field Name Data type Description Common routed See description herein. message format Service Code Unsigned Set to 1. 8 bits Requesting Binary Long address of the Node requesting Node Address 8 octets the association. Embedded Association Response information [Embedded Unsigned Network Security Header of the embedded Net Security 5 octets Association Response. Enabled only if Header] “DLL Security Header Flag” and/or “Network Security Header Flag” are set. Short Address Binary If the Coordinator was not able to 2 octets associate this device to its PAN, this field is set to 0xFFFF, and the associa- tion status field shall contain the reason for the failure. If the Coordi- nator was able to associate the device to its PAN, this field contains the short address assigned to that device. Mesh Key Unsigned For the write operation, this field is the Security 5 octets security information and has the same Header format as the Network Security Header that contains the nonce and key infor- mation used to encrypt the Encrypted Mesh Key. Encrypted Binary Mesh Key encrypted with the Node Key Mesh Key 16 octets used for the Embedded Network Security Header. The Mesh Key is encrypted using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified Node Key. Mesh Key Binary Message Integrity check of the Mesh Key MIC32 4 octets Security Header and the plain text Mesh Key. The MIC is calculated using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified Node Key. Unsigned See sub fields below: 8 bits Reserved Bits 7-4 Set to 0 Mesh Key Bits 3-0 2 = Mesh Key 1 3 = Mesh Key 0 All Selection other values reserved Mesh Key Binary PAN ID associated with the Mesh Key PAN ID 2 octets Association Unsigned 0x00 = Association successful. 0x01 = Status 8 bits PAN at capacity. 0x02 = PAN access denied. Coordinator Unsigned Measure of the number of Nodes already Load 8 bits associated to the network, relative to router capacity. The value 100% means full and no further associations are accepted. [Embedded Binary Network MIC32 of the embedded Net MIC32] 4 octets Association Response.

The Keep Alive Initiate message is sent by the Coordinator to request that a Node initiate immediately its Keep Alive Request. This message is optional and used by the Coordinator to control the flow and distribution of Checkpoint messages. Independently of this optional message, Nodes autonomously initiate their Checkpoint process by sending a Keep Alive Request after each CHECKPOINT_PERIOD. To control the flow of messages, the Coordinator must send a Keep Alive Initiate prior to the expiration of this period. WARNING This request is sent using source routing, Routers routing this message shall not create a temporary route. This allows the following Keep Alive Request to trace current tree route from this Node. The Keep Alive Initiate message format is shown in FIG. 54.

TABLE 18 Keep Alive Initiate Frame Fields Field Name Data type Description Common routed See description herein. message format Service Code Unsigned 8 bits Set to 3. MAC Address Binary 8 octets IEEE 802.15.4 EUI64 address (8-octets) of the targeted Node. Used to validate if the Node receiving this message is the Node expected. If a mismatch is detected, the Node does not return its Keep Alive Request. Information Unsigned 8 bits Specify which information will To be reported in the next Keep Alive Request.

The Keep Alive Request message is sent periodically to the Coordinator to maintain the Node association. The Keep Alive Request frame format is shown is FIG. 55.

TABLE 19 Keep Alive Request Frame Fields Field Name Data type Description Common routed message format See description herein. Service Code Unsigned 8 bits Set to 4. Unsigned 8 bits See sub fields below: Secure Node Bool 0 When reset, the device is not configured for a secure network and all key information provided below shall be ignored. Secondary Network Bool 1 Set if this Message is sent to the Coordinator of secondary network. Device Type Bool 2 Reset when the device is a Router and set when the device is an End Device. Receiver On When Idle Bool 3 Set if the End device does not disable its receiver to conserve power during idle periods. This field can be reset only if the Device Type is set. Information Reported Bit 7-4 Identifier of the optional information reported by the Node within the current Keep Alive Request. 0 = Trace Route 1 = Multicast group address Send by End Devices supporting group address to update its Parent. 2 = Neighbor information This information is useful for Network Management. Can be used by the Coordinator and the Head End to compute routes, find weak region on the mesh network, and evaluate route diversity. 3 = Statistic This information is useful for Network Management. Keep Alive Period Unsigned 8 bits Period in units of 1 min. The reporting Node generates autonomously a Keep Alive Request at the specified periodicity. The Coordinator, at its option, may send a Keep Alive Initiate before the expiration of this period to control the time distribution of Keep Alive Requests of Nodes within the network. MAC Address Binary 8 octets IEEE 802.15.4 EUI64 address (8-octets) of this Node. Used to validate if the Node sending this message is the Node expected. If a mismatch is detected, the Coordinator does not return a Keep Alive Response, but waits for the Node to re-associate. Unsigned 8 bits Reports the current state of the encryption key writes. See fields below: Reserved Bit 7 Set to 0 SMIB Write Toggle Bit 6 Bit toggled each time the SMIB parameter table is written. Node Key-1 Write Toggle Bit 5 Bit toggled each time that Node Key-1 is updated. Node Key-0 Write Toggle Bit 4 Bit toggled each time that Node Key-0 is updated. Mesh Key-1 Write Toggle Bit 3 Bit toggled each time that Mesh Key-1 is updated. Mesh Key-0 Write Toggle Bit 2 Bit toggled each time that Mesh Key-0 is updated. Maintenance Key-1 Write Toggle Bit 1 Bit toggled each time that Maintenance Key-1 is updated. Maintenance Key-0 Write Toggle Bit 0 Bit toggled each time that Maintenance Key-0 is updated. Unsigned 8 bits Reports the current keys used for transmission. See fields below: Current Node Key Bit 5 Node Key used when sending 1 = Node Key-1 0 = Node Key-0 Current Mesh Key Bit 4 Mesh Key used when sending 1 = Mesh Key-1 0 = Mesh Key-0 Current Maintenance Key Bit 3 Mesh Key used when sending 1 = Maintenance Key-1, 0 = Maintenance Key-0 Secondary Node Key Allowed Bool 2 Set when frames may be authenticated via either Node key. Reset when only frames authenticated using the Node key specified by the Current Node Key ID are accepted. Secondary Mesh Key Allowed Bool 1 Set when frames may be authenticated via either Mesh key. Reset when only frames authenticated using the Mesh key specified by the Current Mesh Key ID are accepted Secondary Maintenance Key Bool 0 Set when frames may be authenticated via either Allowed Maintenance key. Reset when only frames authenticated using the Node key specified by the Current Maintenance Key ID are accepted

The following describes the different extensions to this basic frame format. Transmission of these extensions follows these rules, which are listed in order of priority:

-   -   The Trace Route extension is transmitted with the first Keep         Alive sent after a Node associates with a Coordinator, and by         default when no other extension needs to be transmitted.     -   The Multicast Group Addresses extension is transmitted by End         Devices with the first Keep Alive Response sent after each         Parent change.     -   The Statistics extension is transmitted once a day with the         first Keep Alive sent after midnight local time.     -   The Neighbors extension is transmitted once every 4 hours.

The optional Trace Route extension is shown in FIG. 56.

TABLE 20 Keep Alive Request: Optional Trace Route Frame Fields Field Name Data type Description Number of Unsigned 8 bits Number of entries within the Hop Hops list. This list contains an entry for each Node routing this message. Array of . . . Repeating two-component list Hop PAN Binary 2 octets PAN identifier associated to this identifier Hop list entry. Hop Addresses Binary 2 octets Short address associated to this Hop list entry.

This extension is not authenticated by the Network MIC-32 since the Number of Hops value is incremented and a PAN identifier and short address is appended at each hop.

The optional Multicast Group Addresses extension is shown in FIG. 57.

TABLE 21 Keep Alive Request: Optional Multicast Group Addresses Frame Fields Field Name Data type Description Number Of Unsigned Number of Group Address fields. Group 8 bits Addresses Group Array of Group addresses are used during multi- Addresses Binary cast to target a group of Nodes. This 2 octets list corresponds to the groups for which the originator of this message is member. This information is captured by the first Router when the value of Receiver On When Idle is False. In this context, the Router mesh cashed messages targeted to one of these groups until the End Device will wakeup to retrieve this information. This list can also be useful to the Coordinator.

The optional Neighbors extension is shown in FIG. 58.

TABLE 22 Keep Alive Request: Optional Neighbors Frame Fields Field Name Data type Description Number Of Unsigned Number of entry in the Neighbors list. Neighbors 8 bits This list contain the Parents in order of their Preferred Route Ratio (The preferred route is always at index 0) Array Repeating multi-component list of . . . Neighbor Binary See description herein. Address 2 octets Neighbor Binary See description herein. PAN 2 octets Identifier RSSI rx Signed See description herein. 8 bits RSSI tx Signed See description herein. 8 bits LQI rx Unsigned See description herein. 8 bits LQI tx Unsigned See description herein. 8 bits Avg LQI Unsigned Average of the LQI value of each 8 bits hop between the current Node and the Coordinator through this Neighbor using the preferred parent within the specified network tree. The LQI for each hop corresponds to the worst LQI recorded (LQI rx and LQI tx) for this hop. Unsigned 8 bits Number Bits 4-7 Number of hops between the current of Hops Node and the Coordinator through this Neighbor using the preferred parent within the specified network tree. LQI Bit 2-3 LQI class on the link between the Class current Node and this Neighbor based on the worst LQI recorded (LQI rx and LQI tx) for this link. Min LQI Bit 0-1 Minimum of all LQI class for each hop Class between the current Node and the Coor- dinator through this Neighbor using the preferred parent within the speci- fied network tree. Transmission Unsigned See description herein. success rate 8 bits

The optional Statistics extension is shown in FIG. 59.

TABLE 23 Keep Alive Request: Optional Statistics Frame Fields Field Name Data type Description Number Of Unsigned Number of Statistic Code and Statistic Statistics 8 bits Count pairs present in this message. Unsigned 8 bits Statistic Bit 7 0 = The Statistic Count is 16 bits Count 1 = The Statistic Count is 32 bits Format Statistic Bits 6-0 Identifier assigned to the statistic as Code defined in the Statistics codes in 6.7.5.11. New statistics can be added by assigning them new identifiers and including them in the list. Statistics can be deprecated simply by removing them from the list. Statistic Unsigned Actual count of the specific statistic Count integer 16 identified by the Statistic Code. or 32; see specific Statistic Count Format

TABLE 24 Statistics Codes Code Label Description Size (bits) Association process 0 Number of association processes Number of times this Node has initiated an association 16 initiated process 1 Number of association processes From the Number of association processes initiated, 16 successful how many were successful 2 Number of re-associations Number of times the Node has switched networks 16 because of a significant improvement Route Discovery process 3 Number of route discovery Number of times this Node has initiated a route 16 processes initiated discovery process 4 Number of route discovery From the Number of route discovery processes 16 processes successful initiated, how many were successful Checkpoint process 5 Number of Keep Alive Initiate Number of Keep Alive Initiate frames received by this 16 frames received Node. 6 Number of Keep Alive Request Number of Keep Alive Request frames initiated by this 16 frames initiated Node. 7 Number of Keep Alive Response Number of Keep Alive Response frames received by 16 frames received this Node. Outage/Restoration Reporting process 8 Number of power outages Number of power outages recorded by this Node. 16 9 Number of successful power From the Number of power outages, how many were 16 outage notifications reported and acknowledged successfully 10 Number of successful power From the Number of power outages, how many 16 restoration notifications restorations were reported and acknowledged successfully 11 Power outage notification delay Interval (in seconds) elapsed between the outage and 16 the acknowledgment of the notification 12 Power restoration notification Interval (in seconds) elapsed between the restoration 16 delay and the acknowledgment of the notification Ping process 13 Number of Ping Requests Number of Ping Requests initiated by this Node. 16 initiated 14 Number of Ping Responses Number of Ping Responses received by this Node. 16 received Route Establishment process 15 Number of Route establishment Number of Route establishment Requests originated by 16 Requests originated this Node. 16 Number of Route establishment Number of Route establishment Responses received by 16 Responses received this Node. Forwarding Service Message process 17 Number of Service Requests sent Number of Service Requests initiated by this Node. 16 18 Number of Service Requests Number of Service Requests received by this Node. 16 received 19 Number of Service Forwarding Number of Service Requests received and forwarded to 16 Requests sent the requested service provider. 20 Number of Service Forwarding Number of Service Responses forwarded to a 16 Responses received requesting Node. Transmission performance 21 Number of data frames received Number of Data transfer frames received by this Node. 32 22 Number of data frames Number of Data transfer frames originated by this 32 originated Node. 23 Number of data frame failures From the Number of data frames initiated, how many 32 have not been transmitted successfully at the MAC level. 24 Number of broadcast data frames Number of Multicast frames initiated by this Node. 32 25 Number of control frames Number of frames, excluding Data transfer and 32 received Multicast frames, received by this Node. 26 Number of control frames Number of frames, excluding Data transfer and 32 originated Multicast frames, originated by this Node. 27 Number of control frame failures From the Number of control frames originated, how 32 many have not been transmitted successfully at the MAC level. 28 Number of broadcast control Number of control frames broadcast by this Node. 32 frames 29 Number of received local Number of Point to Point messages received by this 32 messages Node. 30 Number of originated local Number of Point to Point messages originated by this 32 messages Node. 31 Number of local message From the Number of originated local messages, how 32 failures many have not been transmitted successfully at the MAC level. 32 Number of broadcast local Number of local broadcasts originated by this Node. 32 frames 33 Number of routed frames Number of data and control frames routed by this 32 Node. 34 Number of routed frame failures From the Number of routed frames, how many have 32 not been transmitted successfully at the MAC level. 35 Number of frames re-broadcast Number of data and control frames re-broadcast by this 32 Node. Radio performance 36 Number of channel access Number of times the radio has returned a Channel 16 failures Access failure during a transmission attempt. 37 Number of buffer overflows Number of times a frame was not transmitted, routed or 16 received because of a lack of available buffer space 38 Number of MAC retries Number of retries at the MAC level when sending a 32 frame. When excessive, this may be evidence of high noise or a jamming attack. 39 Number of FCS errors Number of frames received with an invalid MAC CRC 32 (called an FCS in IEEE 802.15.4). End Device 40 Number of Children Number of End Devices using this Router to send and 16 receive messages. 41 Maximum number of Children Maximum number of End Devices in the End Device 16 Table that use this Router to send and receive messages. 42 Number of pending frames Total number of frames pended for delayed retrieval by 16 Sleeping End Devices 43 Number of frames forwarded Total number of frame received from End Devices 16 from 44 Number of frames forwarded to Total Number of frame forwarded to End Devices 16 45 Number of frames never Total number of frames never delivered to the targeted 16 forwarded End Device 46 Number of forwarding buffer Number of data frames sent to an End Device and 16 overflows dropped by the routing device because of a lack of store and forward buffers. 47 Number of Parent changes Numbers of times the End Device has changed Parents 16 by sending a Keep Alive to a different Router of its primary or any secondary network. Security 48 Total number of security events Number of security related events. Each specific event 32 is totalized by the following statistics. 49 Number of key write operations Number of times a Key has been written 16 50 Number of DLL MIC errors Number of times a frame is received with a valid CRC 16 (FCS) but an invalid DLL MIC. If this rate is high enough, it may be evidence of an attack 51 Number of Network MIC errors Number of times a frame is received with a valid CRC 16 (FCS), a valid DLL MIC but an invalid Network MIC. This may be evidence of an insider attack. 52 Number of DLL nonce count Number of time a frame is received with a valid CRC 16 error (FCS) and valid DLL MIC but with a nonce older than expected. This implies a duplicate or replayed frame. 53 Number of Network nonce count Number of time a frame is received with a valid FCS, a 16 error valid DLL MIC and a valid Network MIC but with a non-reflected nonce. This implies a duplicate or replayed frame. 54 Number of times a Security Number of times a frame or frame is received without 16 header is missing Security when security is expected. 55 Number of Message format Number of times a frame or frame is received with 16 errors invalid content such as an invalid length or an invalid field value. Reset 56 Total number of resets Total number of MCU reset. This counter is in fact the 16 summation of the Number of illegal Op Code resets, the number of watchdog resets and the number of physical resets. 57 Number of illegal Op Code Total number of MCU reset caused by the execution of 16 resets an illegal Op Code. It is important to note that these resets is also a consequence of these resets: MAC supervisor resets, serial port resets and serial port busy resets. 58 Number of watchdog resets Total number of MCU reset caused by the watchdog. 16 59 Number of physical resets Total Number of MCU reset caused by the reset pin. 16 60 Worst stack usage Indicate the minimum number of bytes that remains for 16 stack, since the last radio reprogramming. 61 Current stack usage Indicate the minimum number of bytes that remains for 16 stack, since the last reset. 62 Number of MAC supervisor Number of times the MAC supervisor did a reset of the 16 resets MAC layer after inference of a lockup at that layer. Generate also an “illegal Op Code reset”. 63 Number of serial port resets Total number of MCU reset requested using the serial 16 protocol.. Generate also an “illegal Op Code reset”. 64 Number of serial port busy resets Total number of MCU reset caused by a lock of the 16 serial port. Generate also an “illegal Op Code reset”. 65 Number of tree optimization Total number of preferred parent changed. 16 66 Number of local tree repair Total number of tree repair used 16 67 Number of frame drop, TTL Total number of frame drop caused by TTL expired 16 expired

The Keep Alive Response message is sent by the Coordinator in response to a Keep Alive Request. The Keep Alive Response frame format is shown in FIG. 60.

TABLE 25 Keep Alive Response Frame Fields Field Name Data type Description Common routed See description herein. message format Service Code Unsigned Set to 5. 8 bits Coordinator Unsigned Measure of the number of Nodes Load 8 bits already associated to the network, relative to router capacity. The value 100% means full and no further associations are accepted. MAC Binary IEEE 802.15.4 EUI64 address (8- Address 8 octets octets) of the targeted Node. Only Keep Alive Responses with a valid MAC address are processed. The Node initiates a re-association process if it doesn't receive a valid Keep Alive Response for more than CHECKPOINT_MAX_ATTEMPTS consecutive Keep Alive Requests. Parameter Unsigned List of Parameter ID and Parameter List 8 bits Data pairs. The number of parameters in the list is limited by the space available in the frame. The list always ends with a Parameter ID set to 0, without accompanying data.

The Keep Alive Response parameter list member: current time frame format is shown in FIG. 61.

TABLE 26 Keep Alive Response: Parameter list member: Current time Format Fields Field Name Data type Description Parameter Unsigned Set to 1. ID 8 bits Current Unsigned Date and time of the current UTC minute. minute 32 bits This field is a 32-bit unsigned integer containing the number of minutes since 1970 UTC. Current Unsigned This field is an 8-bit unsigned integer second 8 bits containing the number of seconds in the current minute. Correction Unsigned Rate in hundredths of one percent at ratio 8 bits which the time should be corrected. For example, the value 10 represents a correc- tion rate of 1/10 of 1%, which represents a correction of 3.6 seconds per hour. Time zone Signed Signed number of minutes to add to the offset 16 bits received UTC time to obtain the standard localized time. DST Unsigned Number of additional minutes to add to offset 8 bits the standard localized time to obtain the current localized time. Next DST Unsigned Date and time of the next DST change. change 32 bits This field uses the same encoding as the Current minute field. Next DST Unsigned The offset to use as DST offset after offset 8 bits the Next DST change.

The Keep Alive Response parameter list member: statistics frame format is shown in FIG. 62.

TABLE 27 Keep Alive Response: Parameter list member: Statistics Format Fields Field Name Data type Description Parameter ID Unsigned Set to 2. 8 bits Statistic Unsigned Powerset controlling which statistics Reported 16-octets are reported. For example, bit 5 is set to request reporting of the statistic corresponding to Statistic Code 5. This field is optional and included only when an update is requested.

The Keep Alive Response parameter list member: SMIB parameter update frame format is shown in FIG. 63.

TABLE 28 Keep Alive Response: Parameter list member: SMIB parameter update Format Fields Field Name Data type Description Parameter ID Unsigned 8 bits Set to 3. SMIB Unsigned 8 bits Identifier of the SMIB parameter parameter to be updated. See section 8.10 ID for the list of SMIB parameter ID. SMIB Unsigned 8 bits New value assigned to the parameter SMIB parameter. Value

The Keep Alive Response parameter list member: Write-Switch-Deactivate Key frame format is shown in FIG. 64.

TABLE 29 Keep Alive Response: Parameter list member: Write-Switch-Deactivate Key Format Fields Field Name Data type Description Parameter Unsigned Set to 4. ID 8 bits Unsigned See sub fields below: 8 bits Reserved Bits 7-6 Set to 0x00 Operation Bits 5-4 0x00 = Write the key specified by the Key ID 0x01 = Switch transmissions to the key specified by the Key ID 0x10 = Deactivate reception using the key specified by the Key ID 0x11 = reserved Key ID Bit 3-0 0 = Node Key-1 1 = Node Key-0 2 = Mesh Key-1 3 = Mesh Key-0 4 = Maintenance Key-1 5 = Maintenance Key-0 In all key writes and deactivations, the Node shall validate that the Selected Key is not the key currently in use as the transmit key. Encrypted Unsigned For the write operation, this field is the Key Security 5 octets security information and has the same format Header as the Network Security Header that contains the nonce and key information used to encrypt the Encrypted Key. For the other operations this field is set to 0x00 00 00 00 00 Encrypted Unsigned For the write operation this is the key to Key 16 octets be written, encrypted using the Node Key indicated in the Encrypted Key Security Header. For the other operations this field is set to all 0s. The key is encrypted using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified encryption key. Encrypted Binary Message Integrity check of the Encrypted Key Key MIC32 4 octets Security Header and the plain text key. The MIC is calculated using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified authentication key.

Operations on the Mesh Key are associated with the Mesh Key Table entry for the Coordinator sending the Keep Alive Response message. The Write-Switch-Deactivate Key parameter list member may be occurring multiple times in a message.

The Route Establishment Request message is used by a Node to request from the Coordinator a route to a target Node for peer to peer communication using source routing. The Route Establishment Request message frame format is shown in FIG. 65.

TABLE 30 Route Establishment Request Format Fields Field Name Data type Description Common routed See description herein. message format Service Code Unsigned 8 bits Set to 6. Requested Binary 8 octets IEEE 802.15.4 long address Node Address of the target Node for which a route is requested.

The Route Establishment Response message format shown in FIG. 66 is sent by the Coordinator in response to a Route Establishment Request.

TABLE 31 Route Establishment Response Format Fields Field Name Data type Description Common routed See description herein. message format Service Code Unsigned 8 bits Set to 7. Target Address Binary 2 octets See description herein. Originator Address Binary 2 octets See description herein. Unsigned 8 bits See sub fields below: Number Of PAN Bits 5-4 See description herein. identifiers Number of Hops Bits 3-0 See description herein. Addresses PAN identifiers Up to 3 element See description herein. array Binary 2 octets Hop Addresses Up to See description herein. (MAX_HOPS-1) element array Binary 2 octets

The Power Event Report message is sent by Nodes to notify of a power outage or power restoration condition and the frame format is shown in FIG. 67.

TABLE 32 Power Event Report Frame Fields Field Name Data type Description Common routed See description herein. message format Service Code Unsigned Set to 8 for notifications. Set to 9 for 8 bits acknowledgments. Reporting Array of List of addresses of all devices Source Route Binary forwarding a power outage or a power Node Address 2 octets restoration report. In a request Bit List 15: Power state Set to one if the Node currently has power. Set to zero if the Node currently is in outage. Bits 14-0: device's short address, where Bit 14 is set to zero for Router Nodes and to one for Leaf Nodes

The ping message is used to test mesh communication during quality assessment (QA) or when the network is deployed. The ping message frame format is shown in FIG. 68.

TABLE 33 Ping Frame Fields Field Name Data type Description Common routed See description herein. message format Service Code Unsigned Set to 10 for Ping Request. Set to 11 8 bits for Ping Response. Number Bits 7-6 Defines the number of entries in the of PAN PAN identifiers field. identifiers PAN Array of List of Network identifiers. This list Identifiers up to 3 is referenced by bits 15-14 of the Binary different addresses within the Hop 2 octets Address list. Number Unsigned Actual number of entries in the hop of Hop 8 bits list. This number is increased each time Addresses this frame is received during the round trip between the originator and the target and back to the originator. Array the following three items: of . . . Hop Binary Address of Node receiving this frame Address 2 octets including the target Node and, on return, the Originator Nodes LQI Unsigned LQI recorded at the specified address 8 bits when receiving this message. RSSI Unsigned RSSI recorded at the specified address 8 bits when receiving this message.

The Service Forwarding message is used by the Router servicing a Service Request to send service messages to and from the Coordinator. The Service Forwarding message frame format is shown in FIG. 69.

TABLE 34 Service Forwarding Frame Fields Field Name Data type Description Common routed See description herein. message format Service Code Unsigned Set to 12 for Service Forwarding 8 bits Request. Set to 13 for Service Forwarding Response. Server Unsigned 0 = ANSI C12 Commissioning Host 8 bits Requestor id Unsigned Temporary identifier assigned by the 8 bits originating Router to the requesting Node. This identifier is required if the originating Router is capable of simultaneously servicing Service Requests from multiple Nodes.

The Association Request message is sent by a Node to Router in its neighborhood to request an association to the identified mesh network. The Association Request message frame format is shown in FIG. 70.

TABLE 35 Association Request Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned See subfields below: 8 bits Service Type Bits 6-4 Set to 3. DLL Security Bool 1 Set when the DLL Security Header Header Flag and DLL MIC32 are present Network Security Bool 0 Set when the Network Security Header Flag Header is present [DLL Security Unsigned See description herein. Header] 16 bits [Network Security Unsigned See description herein. Header] 40 bits Service Code Unsigned Set to 0. 8 bits Unsigned See sub fields below: 8 bits Secure Node Bool 0 See description herein. Secondary Network Bool 1 See description herein. Device Type Bool 2 See description herein. Receiver On When Idle Bool 3 See description herein. [Network MIC32] Binary See description herein. 4 octets [DLL MIC32] Binary See description herein. 4 octets

An Association Response message is returned by a Router to a Node in response to an Association Request. An Association Response message frame format is shown in FIG. 71.

TABLE 36 Association Response Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned See subfields below: 8 bits Service Type Bits 6-4 Set to 3. DLL Security Bool 1 Set when the DLL Security Header and Header Flag DLL MIC32 are present Network Bool 0 Set when the Network Security Header Security is present Header Flag [DLL Unsigned See description herein. Security 16 bits Header] [Network Unsigned See description herein. Security 40 bits Header] Service Unsigned Set to 1. Code 8 bits Short Binary If the Coordinator was not able to Address 2 octets associate this device to its PAN, this field is set to 0xFFFF, and the associa- tion status field contains the reason for the failure. If the Coordinator was able to associate the device to its PAN, this field contains the short address assigned to that device. [Mesh Key Unsigned This header, the Encrypted Mesh Key Security 5 octets and the Mesh Key MIC32 fields are trans- Header] ferred from the Association Confirmation Response frame if one exists. [Encrypted Binary This Encrypted Key is passed though from Mesh Key] 16 octets the Association Confirmation Response message. The Mesh Key is encrypted using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified Node Key. [Mesh Key Binary Message Integrity check of the Mesh Key MIC32] 4 octets Security Header and the plain text Mesh Key. The MIC is calculated using the algorithm in IEEE 802.15.4-2006 section B.4 and the specified Node Key. Unsigned 8 bits Reserved Bits 7-4 Set to 0 Mesh Key Bits 3-0 2 = Mesh Key 1 3 = Mesh Key 0 All Selection other values reserved Mesh Key Binary PAN ID associated with the Mesh Key PAN ID 2 octets Association Unsigned 0x00 = Association successful. 0x01 = PAN Status 8 bits at capacity. 0x02 = PAN access denied. Coordinator Unsigned Measure of the number of Nodes already Load 8 bits associated to the network, relative to router capacity. The value 100% means full and no further associations are accepted. [Network Binary See description herein. MIC32] 4 octets [DLL Binary See description herein. MIC32] 4 octets

The Neighbor Info Request message is broadcast to get information about neighbor Routers. The frame format shown in FIG. 72 is used when the originator of the message is not a network member. The frame format shown in FIG. 73 is used when the originator of the message is a network member.

TABLE 37 Neighbor Info Request Frame Fields Field Name Data type Description Common MAC Unsigned 8 bits See description herein. layer fields Unsigned 8 bits See subfields below: Service Type Bits 6-4 Set to 3. Service Code Unsigned 8 bits Set to 2. Network Name Unsigned 8 bits Size in number of octets of the Prefix Length Network Name Prefix field. Network Name String Only Node members of a Prefix network whose name starts with this string return Neighbor Info Response frames.

The Neighbor Info Response message is sent by each neighbor Router when a Neighbor Info Request is broadcast. This message contains the network name and Coordinator load of the responding neighbor, the quality of the requesting Node's signal as received by this neighbor, and the list tree position of this neighbor on different network trees. The Neighbor Info Response message frame format for an non-network originator is shown in FIG. 74. The Neighbor Info Response message frame format for an in-network originator is shown in FIG. 75.

TABLE 38 Neighbor Info Response Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned See subfields below: 8 bits Service Bits 6-4 Set to 3. Type Security Bool 2 Set when Source Count and Ticket Count Count are present. Present Service Unsigned Set to 3. Code 8 bits Source Binary DLL Security nonce count to be used to Count 5 octets validate secure messages from this device. The value received in a message from this source must be greater than this value. The resulting database value is updated each time a valid message is received. Ticket Binary DLL Security nonce count to be used to Count 5 octets send secure messages to this device. This value is pre-incremented before each transmission. Unsigned See sub fields below: 8 bits Dedicated Bit 7 Set when this Node is a Dedicated Router. Router This value is used to compute the associa- Flag tion ratio. It is also used by a Dedicated Router to validate that it associates directly only with a Coordinator or another Dedicated Router. End Device Bits 6-0, Measure of the number of End Device which Load range are already Children of this Router, rela- 0-100 tive to router capacity. The value 100% means full and no further End Device are accepted. Unsigned See sub fields below: 8 bits Neighborhood Bool 7 When set, this Router can't be used Table Full as an Association Router because it neighborhood table is already full with direct Parents and Children. Coordinator Bits 6-0, Measure of the number of Nodes already Load range associated to the network, relative to 0-100 router capacity. The value 100% means full and no further associations are accepted. Requestor Unsigned Link Quality Indicator of messages LQI rx 8 bits received from the requesting Node. Network Name Unsigned Size in number of octets of the Network Length 8 bits Name field. Network String Name assigned to the network on which Name this Node is associated. Number of Unsigned Number of network tree descriptions Network 8 bits available in the following list. Trees Array the following fields of . . . Tree PAN Binary See description herein. Identifier 2 octets Avg LQI Unsigned See description herein. 8 bits Unsigned See sub fields below: 8 bits Number of Bits 7-4 See description herein. Hops Power Outage Bool 2 See description herein. Routing Min LQI Bits 1-0 See description herein. Class

The Neighbors Exchange message is broadcast locally by each Node and used to maintain the neighborhood information and to optimize the network tree. The Neighbors Exchange message frame format is shown in FIG. 76.

TABLE 39 Neighbors Exchange Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned See subfields below: 8 bits Service Bits 6-4 Set to 3. Type DLL Bool 1 Set when the DLL Security Header Security and DLL MIC32 are present Header Flag [DLL Unsigned See description herein. Security 16 bits Header] Service Unsigned Set to 4. Code 8 bits Unsigned See subfields below: 8 bits Immediate Bool 7 Set when the originator of the message Broadcast needs to get information from neighbors Requested in a short interval of time. When set, recipients send their Neighbors Exchange message using a pseudo- randomly chosen delay within NEIGHBOR_EX_RND_PERIOD. This feature is used by Nodes participating in overlapping networks. reserved Bits 0 to 6 Network List Unsigned Number of entries in the following Length 8 bits list. Network List Tree PAN Binary See description herein. Identifier 2 octets Neighbor Binary See description herein. Address 2 octets Neighbor PAN Binary See description herein. Identifier 2 octets Avg LQI Unsigned See description herein. 8 bits Unsigned See subfields below: 8 bits Number of Bits 7-4 See description herein. Hops Preferred Bool 3 See description herein. Parent Flag Power Outage Bool 2 See description herein. Routing Min LQI Bits 1-0 See description herein. Class LQI List Unsigned Number of entries in the LQI list Length 8 bits below. LQI List This list use the space remaining in the frame and contains 23 entries when the Network List contain one entry, 20 when the Network List contain 2 entries and 17 when the Network List contain 3 entries. Neighbor Binary Address of the neighbor for which Short 2 octets the LQI is reported. Address LQI rx Unsigned Link Quality measured by this 8 bits neighbor when receiving messages from the current Node, averaged over time. Success Bool 7 Set to 1 if the last Neighbor Exchange Indication of this neighbor was received success- fully. Used to calculate TX success rate. Absolute Bits 6-0 Absolute Received Signal Strength RSSI rx Indicator measured by this neighbor when receiving messages from the current Node. Must be multiply by −1 to obtain the value in dBm. [DLL Binary See description herein. MIC32] 4 octets

The End Device Data Request message is used by an End Device to request pending data messages from its Parent. The End Device Data Request message frame format is shown in FIG. 77.

TABLE 40 End Device Data Request Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned 8 bits See subfields below: Service Type Bits 6-4 Set to 3. DLL Security Bool 1 Set when the DLL Security Header Header Flag and DLL MIC32 are present [DLL Security Unsigned 16 bits See description herein. Header] Service Code Unsigned 8 bits Set to 5 [DLL MIC32] Binary 4 octets See description herein.

The End Device Data Response message is used in response to an End Device Request to indicate the presence or not of pending data. The End Device Data Response message frame format is shown in FIG. 78.

TABLE 41 End Device Data Response Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned 8 bits See subfields below: Service Type Bits 6-4 Set to 3. DLL Security Bool 1 Set when the DLL Security Header Header Flag and DLL MIC32 are present [DLL Security Unsigned 16 bits See description herein. Header] Service Code Unsigned 8 bits Set to 6 Data Pending Unsigned 8 bits 0 = No data pending 1 = Pending data [DLL MIC32] Binary 4 octets See description herein.

The Service Request message is used by a device non-member of the network to communicate with a specific service such as the commissioning service. The Router used as a proxy is responsible for limiting the flow of messages to provide protection from denial of service attacks. See the Forwarding Service Messages for more detail. The Service Request message frame format is shown in FIG. 79. The Service Request Response frame format is shown in FIG. 80.

TABLE 42 Service Request Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned 8 bits See subfields below: Service Type Bits 6-4 Set to 3. DLL Security Bool 1 Set to 0. The DLL Security Header Header and DLL MIC32 is not present Service Code Unsigned 8 bits Set to 7. Server Unsigned 8 bits 0 = ANSI C12 Commissioning Host Payload Multi-octet Up to the maximum frame length permitted by IEEE 802.15.4.

The common frame format for most point to point messages is shown in FIG. 81.

TABLE 43 Common point to point messaging Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned 8 bits See subfields below: Service Type Bits 6-4 Set to 5. DLL Security Bool 1 Set when the DLL Security Header Header Flag and DLL MIC32 are present [DLL Security Unsigned 16 bits See description herein. Header] See the different message specific contents in the following. [DLL MIC32] Binary 4 octets See description herein.

The Local Data Transfer message is used to transport upper layers information for a point to point communication. The Local Data Transfer message frame format is shown in FIG. 82.

TABLE 44 Local Data Transfer Frame Fields Field Name Data type Description Common MAC See description herein. layer fields Unsigned 8 bits See subfields below: Service Type Bits 6-4 Set to 5. Service Code Unsigned 8 bits Set to 0. Payload Multi-octet Upper layer information.

The Frame Reception Rate Test Init messages are used to compute the Frame Reception Rate. This function is provided mainly in support of radio manufacturing. A test is initiated by sending a Frame Reception Rate Test Init frames, follow by one or a multitude of Frame Reception Rate Test Data frames, followed by an optional Frame Reception Rate Test End frame. The target Node responds to the Frame Reception Rate Test End frame with a Frame Reception Rate Test Result frame. When a Frame Reception Rate Test Result is not received, the originator can retry by sending one or more Frame Reception Rate Test End frames. The Frame Reception Rate Test Init message frame format is shown in FIG. 83.

TABLE 45 Frame Reception Rate Test Init Frame Fields Field Name Data type Description Common p2p See description herein. message format Service Code Unsigned Set to 1. 8 bits Sequence Unsigned Set to 0. Number 8 bits Count Unsigned Number of Frame Reception Rate Test 8 bits Data frames to be transmitted. Length Unsigned Size of the Frame Reception Rate Test 8 bits Data frame requested or sent. This size shall match the value of the Frame Length of that Frame Reception Rate Test Data frame as defined in the Physical layer of IEEE 802.15.4, which includes all MAC headers and the CRC (FCS0 trailer Mode Unsigned 0 = Acknowledgment and retries 8 bits disabled 1 = Acknowledgment and retries enabled

The frame format for the Frame Reception Rate Test Data is shown in FIG. 84.

TABLE 46 Frame Reception Rate Test Data Frame Fields Field Name Data type Description Common p2p See description herein. message format Service Code Unsigned Set to 2. 8 bits Sequence Unsigned Pre-incremented before each transmission. Number 8 bits Count Unsigned Duplicate of the value sent in the Frame 8 bits Reception Rate Test Init frame. Length Unsigned Duplicate of the value sent in the Frame 8 bits Reception Rate Test Init frame. Mode Unsigned Duplicate of the value sent in the Frame 8 bits Reception Rate Test Init frame. Padding Unsigned Octets added to the Frame Reception 8 bits Rate Test Data frame to adjust its size to the dimension requested by the initiating Frame Reception Rate Test Init frame's Length field.

The frame format for the Frame Reception Rate Test End is shown in FIG. 85.

TABLE 47 Frame Reception Rate Test End Frame Fields Field Name Data type Description Common p2p message format See description herein. Service Code Unsigned 8 bits Set to 3.

The frame format for the Frame Reception Rate Test Result is shown in FIG. 86.

TABLE 48 Frame Reception Rate Test Result Frame Fields Field Name Data type Description Common p2p message See description herein. format Service Code Unsigned 8 bits Set to 4. Number Of Frame Unsigned 8 bits Number of frames received Received since the last Frame Reception Rate Test Init frame. Average RSS Signed 8 bits Average RSS of all the frames received since the last Frame Reception Rate Test Init frame.

The Local Broadcast Request message is used to retrieve a list of local devices. The Local Broadcast Request message frame format is shown in FIG. 87.

TABLE 50 Local Broadcast Request Frame Fields Field Name Data type Description Common See description herein. MAC layer fields Unsigned See subfields below: 8 bits Service Bits 6-4 Set to 5. Type Service Unsigned Set to 20. Code 8 bits Maximum Signed Used to exclude devices in close proximity. RSSI 8 bits A response is sent only if the RSSI measured at the reception of this message by the target device is less than the value specified. Minimum Signed Used to exclude too distant devices. A response RSSI 8 bits is sent only if the RSSI measured at the recep- tion of this message by the target device is greater than the value specified. Max Delay Unsigned Maximum delay in units of 1/10 second before Period 8 a response is returned. Each target Node computes a random response delay within this period. Unsigned See sub fields below: 8 bits Payload Bits 2-0 Specifies the information included in the Content frame's Payload field. 0 = None 1 = None. This is a walk-by request; Respond only if supported and not already processed 2 = Network name 3 = Network name prefix 4 = Bar code 5 = Communications module serial number Requested Bits 5-3 Specifies the information to be included in Response the Local Broadcast Response. 0 = None Payload 1 = Network name 2 = Security enable flag, Owner, Bar code id Payload Multi- When present a response is sent only if a octet match exists with the information provided. The length of this field is defined by the remaining capacity of this frame as defined by IEEE 802.15.4

The Local Broadcast Response message is sent by all Nodes which have received a Local Broadcast Request with matching criteria (RSSIs and Payload). The Local Broadcast Response message frame format is shown in FIG. 88.

TABLE 51 Local Broadcast Response Frame Fields Field Name Data type Description Common See description herein. MAC layer fields Unsigned See subfields below: 8 bits Service Bits 6-4 Set to 5. Type Service Unsigned Set to 21. Code 8 bits Source Binary Short address of the responding Node. Address 2 octets Device Binary This identifier is used to load the appro- Class 4 octets priate context for this device, data model and business logic. For table driven devices, this field is equivalent to the DEVICE_CLASS field of the ANSI C12.19- 2008, General Configuration Table (Table 0). Unsigned See sub fields below: 8 bits Counts Bool 7 Set when the Source Count and Ticket Present Count are present. These counters are required to authenticate subsequent communication. Payload Bits 3-0 Specifies the information included at the Content ID end of this message in the Payload field: 0 = None 1 = Network name 2 = Security, Version, Owner and Bar code Source Binary DLL Security nonce count to be used to Count 5 octets validate secured messages from this device. The value received from this source must be greater than the value received in this frame. This value is updated each time a valid frame is received. Ticket Binary DLL Security nonce count to be used to Count 5 octets send secured messages to this device. This value is pre-incremented before each transmission. Payload Binary The length of this field is defined by the remaining space for this frame as defined by the Physical layer.

Within the Local Broadcast message is the Payload Content ID 1 which has the frame format shown in FIG. 89.

TABLE 52 Local Broadcast: Payload Content ID 1 Frame Fields Field Name Data type Description Network String Network Name assigned to this specific mesh name network.

Within the Local Broadcast message is the Payload Content ID 2 which has the frame format shown in FIG. 90.

TABLE 53 Local Broadcast: Payload Content ID 2 Frame Fields Field Name Data type Description Unsigned See subfields below: 8 bits Security Bool 7 Set if the responding device has been Enable Flag configured with its passwords or/and keys and subsequent communication needs to follow the security policies specified for this device. Bit 4 Set to 1 for backward compatibility. Owner Bits 3-0 Number of octets of Owner field. Field Length Firmware Unsigned Version of the host device. This informa- version 8 bits tion is used to configure the device context. Firmware Unsigned Revision of the host device. This informa- revision 8 bits tion is used to configure the device context. Owner String Identifier of the owner of this device - information which is used to select the proper password or keys when the Security Enable Flag is set. Bar String Identifier available as a readable bar code code id on the device.

The End Device Node Present message is sent by a battery operated device, e.g. a sleeping device to a wake-up device, following an impulse, such as a magnetic impulse, from a wake-up device, e.g., hand-held device. The End Device Node Present message frame format is shown in FIG. 91.

TABLE 54 End Device Node Present Frame Fields Field Name Data type Description Common MAC layer fields See description herein. Unsigned 8 bits See subfields below: Service Type Bits 6-4 Set to 5. Service Code Unsigned 8 bits Set to 22. Source Address Binary 2 octets See description herein. Device Class Binary 4 octets See description herein. Unsigned 8 bits See sub fields below: Counts Present Bool 7 See description herein. Payload Content ID Bits 3-0 Set to 2. Source Count Binary 5 octets See description herein. Ticket Count Binary 5 octets See description herein. Unsigned 8 bits See sub fields below: Security Enable Flag Bool 7 See description herein. Owner Field Length Bits 3-0 See description herein. Firmware version Unsigned 8 bits See description herein. Firmware revision Unsigned 8 bits See description herein. Owner String See description herein. Bar code id String See description herein.

The Range Test Request message is used to record the signal strength (RSSI) in both directions between two Nodes. The Range Test Request message frame format is shown in FIG. 92.

TABLE 55 Range Test Request Frame Fields Field Name Data type Description Common p2p message format See description herein. Service Code Unsigned 8 bits Set to 30.

The Range Test Response command is returned in response to the Range Test Request. The format is shown in FIG. 93.

TABLE 56 Range Test Response Frame Fields Field Name Data type Description Common p2p See description herein. message format Service Code Unsigned 8 bits Set to 31. RSSI Signed 8 bits Received Signal Strength Indicator of the Range Test Request when received by the target Node. This field is encoded using a signed integer in dBm. LQI Unsigned 8 bits Link Quality Indicator of the Range Test Request when received by the target Node.

The Range Test Initiate command is used to request that a Node initiate a Range Test Request to a target Node. The Range Test Initiate command frame format is shown in FIG. 94.

TABLE 57 Range Test Initiate Frame Fields Field Name Data type Description Common p2p message format See description herein. Service Code Unsigned 8 bits Set to 32. Target Address Binary 8 octets Address of the target Node.

The Range Test Result command is used in response to a request that a Node initiate the Range Test Request to a target Node. The Range Test Result command frame format is shown in FIG. 95.

TABLE 58 Range Test Result Frame Fields Field Name Data type Description Common p2p See description herein. message format Service Unsigned Set to 33. Code 8 bits Originator Signed Received Signal Strength Indicator of the RSSI 8 bits Range Test Request when received by the target Node. This field is encoded using a signed integer in dBm. Originator Unsigned Link Quality Indicator of the Range Test LQI 8 bits Request when received by the target Node. Target Signed Received Signal Strength Indicator of the RSSI 8 bits Range Test Response when received by the originator Node. This field is encoded using a signed integer in dBm. Target Unsigned Link Quality Indicator of the Range Test LQI 8 bits Response when received by the originator Node.

The 802.15.4 standard states the following about Link Quality Indicator (“LQI”). The LQI measurement is a characterization of the strength and/or quality of a received frame. The measurement may be implemented using receiver ED, a signal-to-noise ratio estimation, or a combination of these methods. In a preferred embodiment, transceivers, are used to measure signal strength. The LQI is calculated as follows:

$\begin{matrix} {{lqi} = \left\{ \begin{matrix} {10 + {\frac{255}{77}*l}} & {{{for}\mspace{14mu} - 3} \leq l \leq 74} \\ 0 & {{{for}\mspace{14mu} l} < {- 3}} \\ 255 & {{{for}\mspace{14mu} l} > 74} \end{matrix} \right.} & \left( {{Equation}\mspace{14mu} 1} \right) \end{matrix}$

where l is the received signal level in dB above the sensitivity level of the radio on the meter (node). The sensitivity is measured for each radio model used in the mesh network. It is defined as the signal level above ambient noise for which a frame reception rate of 99% is obtained. Measurement is done with a wired lab setup with frame lengths of 127 octets.

LQI classes group together links that have similar probability of successful transmission. Various studies on RF propagation, mostly targeting cellular market, suggest using a fade margin between 20 and 40 dB. Since the meters in the preferred embodiment are fixed and time dependent, attenuation is only caused by the movement of external obstacles (persons, vehicles).

Accordingly, a margin of 15 dB should be sufficient to have a reliable link. In other words we consider a link with a signal strength 50 dB above the sensitivity level has about the same chances of success as a link with a signal strength 15 dB above sensitivity. The limit for average links is set at 5 dB above sensitivity. Table 59 summarizes the significance of the LQI classes.

TABLE 59 LQI Class Class ID LQI Meaning 0 0 No link 1 1 to LQI_CLASS1_HIGH_THRESHOLD Unreliable link 2 (LQI_CLASS1_HIGH_THRESHOLD + 1) Average link to LQI_CLASS2_HIGH_THRESHOLD 3 (LQI_CLASS1_HIGH_THRESHOLD + 1) Reliable link to 255

The Association Ratio is calculated by a Node to select which Coordinator to choose. It is a weighted sum of: the “Number of Hops” to the Coordinator (from Neighbor Info Response), the “Coordinator Load” (from Neighbor Info Response), the number of local neighbors (from the number of Neighbor Info Responses received for the selected network) and the “Min LQI Class” (maximum value from all Neighbor Info Response adjusted for last hop). Table 60 lists the weighting factors.

TABLE 60 Association Ratio Weighting Factors Default Weighting Weighted Weighting Factor Parameter Factor in % Formula Variable COORD_LOAD_WEIGHT 40 Coordinator Load HOP_NUM_WEIGHT 40 Number of Hops NUM_NEIGHBORS_WEIGHT 10 Number of Neighbors LQI_CLASS_WEIGHT 10 Min LQI Class

The Formula for the Association Ratio is:

If entry = new new entry Freshness = 0xFF For each other entry If entry Freshness = 0, entry Freshness = 0 Else entry Freshness = Freshness −1 Else Temp_Freshness = access entry Freshness accessed entry Freshness = 0xFF For each other entry If entry Freshness = 0 entry Freshness = 0 Else If entry Freshness >Temp_Freshness entry Freshness = Freshness −1 Else entry Freshness = Freshness

The Preferred Route Ratio is computed by a Node to select within its Parents, the one that represents the optimized path to access the Coordinator. This ratio is calculated based on the neighborhood table information as received within a Neighbor Info Response or a Neighbors Exchange.

-   -   Preferred Route Ratio=Min LQI class<<12|(15−Number of         Hops)<<8|Avg LQI

The preferred Router, based on this ratio, will correspond to:

-   -   For all the possible routes with the best min LQI class, select         the routes with the least number of hops     -   From this remaining list, select the one with the best Avg LQI         (not used to change the preferred routers)

End Devices selects a neighboring Router based on the following criteria applied in the order indicated:

-   -   From the list of neighbors with the best LQI class (Class         computed only on the link between the RFD and its neighbor)         select the Routers with the lowest “Router load”     -   From the remaining list, select a Router with the least number         of hops     -   From the remaining list, select the Routers with the best avg         LQI

The pseudo-random delays required by Nodes for this layer are computed based on the following equation:

pseudoRandomNumber=((shortAddress&0x7F)<<6) XOR ((longAddress>>i)&0x7F) XOR ((pseudoRandomValue>>i)&0x7F)

pseudoRandomPeriod (sec)=pseudoRandomNumber*period/8191

Each time a pseudo-random number is generated, i=((i+1) % 8)

The pseudoRandomValue represents a value within the radio which changes over time, such as the Neighbor table checksum or the “Number of frames transmitted” statistic.

For example:

16 bitsAddress=35=0100011

longAddress=948347=11100111100001111011

pseudoRandomValue=3384854=1100111010011000010110

period=20 s

1th pseudoRandom period=(0100011<<6)

-   -   xor 1111011     -   xor 0010110     -   =0100010101101=2221*20/8191=5,423 s

2nd pseudoRandom period=(0100011<<6)

-   -   xor 0111101     -   xor 0001011     -   =0100011110110=2294*20/8191=5,601 s

3rd pseudoRandom period=(0100011<<6)

-   -   xor 0011110     -   xor 0000101     -   =0100011011011=2267*20/8191=5,535 s

4th pseudoRandom period=(0100011<<6)

-   -   xor 0001111     -   xor 1000010     -   =0100010001101=2189*20/8191=5,344 s

The IEEE 802.15.4 short addresses are assigned sequentially by the coordinator. Six bits of this address are used to partition Nodes into 64 different groups. This number represents bits 8 to 13 of the final pseudo-random number. For example, if a network has 432 Nodes, between 6 and 7 End points will share the same 6 bits. Bit 0 to 7 of the pseudo-random number is computed based on the IEEE 802.15.4 long address and a pseudo-random value that changes over time.

The pseudo-random number generated is a number between 0 and 8191, which needs to be scaled for the appropriate range.

The following tables propose data structure definitions in support of the implementation of the SM layer discussed herein and may be adapted for each specific implementation.

TABLE 61 Global Variables Field Name Data type Description PAN Unsigned Indication of the number of Nodes actually Coordinator 8 bits associated to the Coordinator as reported Load by the last Neighbors Exchange message received from a Parent. End Unsigned Value maintained by each Router which repre- Device 8 bits sents a percentage of its maximum capacity Load to accept and manage End Devices. Counter Unsigned The DLL and Network Security nonce count 5 octets used for all transmissions after the device has associated with the network. This count is stored in non-volatile memory and never reset. The value stored in this table corresponds to the next value to be used. Ticket Unsigned Nonce count provided to Nodes not associated 5 octets to the network. This count is stored in non- volatile memory and never reset. The value stored in this table corresponds to the next ticket to be sent.

The Mesh Key Tables stores the Mesh Key(s) used by the device. Each Mesh Key is associated with the PAN ID of the Coordinator it is used with. Mesh Keys are administered by the associated Coordinator.

TABLE 62a Mesh Key Table Field Name Data type Description Mesh Key Array(MAX_ASSOCIATIONS) The Mesh Key Table Table of Mesh Key Entries stores the Mesh Key information associated with each Coordinator the device associates with. Associated Unsigned 1 octet The number of Coordinators Coordinators the device has associated with.

TABLE 62b Mesh Key Table: Mesh Key Entry Field Name Data type Description Coordinator Unsigned The PAN ID of the Coordinator associated PAN ID 2 octets with the Mesh Key Entry The entire Mesh Key Entry is disabled when the Transmit Mesh Key ID is disabled. Mesh Key-0 Unsigned In the context of the SM DLL Security, 16 octets Mesh key used when the DLL Key ID is set to 0. In the context of the SM End- To-End Network Security, Mesh key used when the Network Key ID is set to 0. Mesh Key-1 Unsigned In the context of the SM DLL Security, 16 octets Mesh key used when the DLL Key ID is set to 1. In the context of the SM End- To-End Network Security, Mesh key used when the Network Key ID is set to 1. Unsigned See fields below: 8 bits Bits 7-5 Reserved, set to 0 Mesh Key Entry Bool 4 Set when Mesh Key Table Entry active Active Secondary Mesh Bool 3 Set when it is allowed to accept frames Key Allowed authenticated using either Mesh Key. Reset when only frames authenticated using the Mesh key specified by the Transmit Mesh Key ID are accepted Transmit Mesh Bit 2 0 = Mesh Key-0 used for transmissions Key ID 1 = Mesh Key-1 used for transmissions Mesh Key-1 Bit 1 Every update operation on a Mesh Key-1 Write Toggle toggles the write bit. Initialized to 0. Mesh Key-0 Bit 0 Every update operation on a Mesh Key-0 Write Toggle toggles the write bit. Initialized to 0.

The Node Key table stores the Node Key(s) used by the device. The SM network security process uses the Node Key Table to look up the information needed for the Network Security MIC calculation for messages between the Coordinator and devices. The information in the Node Key Table is retained during a power outage and a device reset.

TABLE 63 Node Key Table Field Name Data type Description Node Key-0 Binary, Node Key used when the Network Security 16 octets header is present and the Network Key ID is set to 0. Node Key-1 Binary, Node Key used when the Network Security 16 octets header is present and the Network Key ID is set to 1. Unsigned See fields below: 8 bits Bits 7-4 Reserved, set to 0 Secondary Bool 3 Set when it is allowed to accept frames Node Key authenticated using either Node key. Allowed Reset when only frames authenticated using the Node key specified by the Transmit Node Key ID are accepted Transmit Bit 2 0 = Node Key-0 used for transmissions Node Key ID 1 = Node Key-1 used for transmissions Node Key-1 Bit 1 Every update operation on a Node Key-1 Write Toggle toggles the write bit. Initialized to 0. Node Key-0 Bit 0 Every update operation on a Node Key-0 Write Toggle toggles the write bit. Initialized to 0.

The Maintenance Table stores the information used for Nodes associating with the network and for maintenance devices that access the Nodes using point-to-point messages. The information in the Maintenance Table is retained during a power outage and a device reset.

TABLE 64 Maintenance Key Table Field Name Data type Description RX Binary, The last valid Source count valued received Source 5 octet for the routing device and used during DLL Nonce association or the point-to-point communica- Count tion device for playback protection. This value is initiated by the Neighbor Infor- mation Response or the Local Broadcast Response Ticket Binary, Use instead of the Counter defined in the Count 5 octet Global variables when a Node is not wet associated. This value is initiated by the Neighbor Info Response message, End Device Node Present message or the Local Broadcast Response message Maintenance Binary, Maintenance Mesh key used when the DLL Key-0 16 octets Key ID is set to 0. Maintenance Binary, Maintenance Mesh key used when the DLL Key-1 16 octets Key ID is set to 1. Unsigned See fields below: 8 bits Bits 7-5 Reserved, set to 0 Maintenance Bool 4 Set when reception using Maintenance Key-1 Receive Key-1 is enabled Enabled Secondary Bool 3 Set when it is allowed to accept frames Maintenance authenticated using either Maintenance Key Allowed key. Reset when only frames authenticated using the Maintenance key specified by the Transmit Maintenance Key ID are accepted Transmit Bit 2 0 = Maintenance Key-0 used for trans- Maintenance missions 1 = Maintenance Key-1 used Key ID for transmissions Maintenance Bit 1 Every update operation on a Maintenance Key-1 Write Key-1 toggles the write bit. Initialized Toggle to 0. Maintenance Bit 0 Every update operation on a Maintenance Key-0 Write Key-0 toggles the write bit. Initialized Toggle to 0. Last Binary, The address of the last device address to Maintenance 8 octets use the key. Set to zero if no access has Address been made. Previous Binary, The address of the previous device to use Maintenance 8 octets the key. The address is always different Address from the Last Maintenance Address. It is set to zero if there is no previous Maintenance device.

The Neighborhood Table data structure is maintained in each radio to keep the information about neighbor Nodes. This data structure is required to implement at least the following processes: Association. Tree Routing, Route Discovery, Neighbors Exchange. Tree Optimization, Checkpoint.

TABLE 65a Neighborhood Table Field Name Data type Description Neighborhood array[MAX_NUM_NEIGHBORS] List of neighbors Table of Neighborhood Table Entry

TABLE 65b Neighborhood Table Entries Field Name Data type Description Tree PAN Binary Identify the network tree for this entry. This Identifier 2 octets network identifier can correspond to foreign network when the concept of overlapping network is implemented. In this context, the same neighbor can be reported multiple times within this list if associated to multiple network trees. Neighbor Binary Address of this neighbor. Address 2 octets Neighbor Binary Membership of this neighbor. PAN 2 octets Identifier Avg LQI Unsigned Average of the LQI value of each hop between 8 bits this neighbor and the Coordinator using the preferred parent within the specified network tree. The LQI for each hop corresponds to the worst LQI recorded (LQI rx and LQI tx) for this hop. Unsigned See sub fields below: 8 bits Number of Bits 7-4 Number of hops between this neighbor and the Hops Coordinator using the preferred parent within the specified network tree. LQI Class Bool 3-2 LQI class for the hop between the current node and this neighbor. Min Bit 1-0 Minimum of all LQI rx and LQI tx for each LQI Class hop between this neighbor and the Coordinator using the preferred parent within the speci- fied network tree. LQI rx Unsigned Average link quality measured for frames 8 bits received from this neighbor. LQI tx Unsigned Average link quality measured for frames 8 bits transmitted to this neighbor. RSSI rx Signed Average signal strength in dBm measured for 8 bits frames received from this neighbor. RSSI tx Signed Average signal strength in dBm measured for 8 bits frames transmitted to this neighbor. Unsigned See sub fields below: 8 bits New Entry Bool 7 Set to true if this entry has not been sent at Flag least once in a Neighbor Exchange message. It is not allowed to reuse an entry when this flag set to true. The intent of this flag is to give enough time to child candidates to choose the current node as preferred parent. Power Bool 6 Set if this neighbor supports routing for some Outage period of time after a power outage. Routing Remote Bool 5 Set when this neighbor reports that the current Preferred Node is its parent. Parent Flag Preferred Bool 4 Set when this neighbor is the parent of the Parent Flag current Node within the specified network tree. When set to false, this Neighbor can still be used for tree routing if its Number of Hops is less or equal to the current Node. Freshness Bits 3-0 Countdown reset at each Neighbors Exchange received from this neighbor and decremented at each Neighbors Exchange period (each time a Neighbors Exchange transmitted by the radio). When this field reach zero, the entry is considered deleted and can be reused for a different Node. Preferred Unsigned Preferred Route Ratio as defined herein. This Route Ratio 16 bits value is adjusted up to the current Node. RX Source Unsigned The last authenticated DLL full nonce count DLL Nonce 5 octets received from this neighbor. Count Transmission Unsigned Success rate in percentage of the last n success rate 8 bits transmission with this neighbor The value255 means no data available for that neighbor. This value is initialized to 100 prior to the first transmission and is updated as follows: When the transmission is successful S = MIN(s + (s/n) + (l/n), 100) When the transmission fails: S = s − (s/n) For either case the Neighbor Table entry is: “Transmission success rate” = ROUND(S, 0) Where S: Estimated success rate s: Last estimated success rate n: Factor to adjust the adjustment speed of the estimated average (set by default to 30) Note that the ROUND(S, 0) function rounds the S to the nearest integer and the MIN(x, y) function selects the smaller of x and y.

When the number of Neighbors exceeds the capacity of the Neighborhood table, the goal is to keep in the table 5 best Parents/Siblings (best routes) and all nodes that set the current node as preferred Parent (avoid tree instability). We also want to give a chance to new candidates to flag the current Node as preferred Parent. This is done by including them in a round robin fashion among others entry. The radio applies the following logic when it receives a new candidate.

If the new candidate is a not a parent, replace the next entry that:

-   -   is not one of the 5 best Parents/Siblings     -   has not select the current Node as preferred parent     -   was sent at least once in a Neighbor Exchange message.

This last clause (3) allows candidates to receive the information needed to choose this node as preferred Parent. If the new candidate has flagged the current node as preferred Parent, this last condition is ignored.

If the new candidate is a Parent/Sibling:

-   -   If we have less than 5 best Parents/Sibling, use the same scheme         as if it was not a parent. In last resort, replace a node that         set the current Node as preferred parent using the same round         robin scheme.     -   If we have already 5 best Parents/Sibling, replace the worst         Parent/Sibling if the candidate's preferred route ratio is         greater than its preferred route ratio.

The Routing table is used to maintain routes established using the Route Discovery process.

TABLE 66a Routing Table Field Name Data type Description Route Table array[MAX_NUM_STATIC_ROUTES] List if mesh of Route Table Entry routes

TABLE 66b Route Table Entry Field Name Data type Description Target Binary MAC address of target Node Address 2 octets Next Hop Binary MAC address of the Node used to route Address 2 octets the frame to the target Node Freshness Unsigned Decremented each time the table is used 8 bits for another entry. Reset to 0xFF each time the entry is used.

Freshness rules for each time the table is accessed:

IF Coordinator Load is 100% Ignore this network IF Coordinator Load < 20% Association Ratio = COORD_LOAD_WEIGHT ELSE Association Ratio = COORD_LOAD_WEIGHT * (1 −((Coordinator Load − 20) / 80)) IF the Dedicated Router Flag of the selected Association Router is true Association Ratio += HOP_NUM_WEIGHT ELSE Association Ratio += HOP_NUM_WEIGHT * (1−(Number of Hops)/(MAX_HOPS−1)) IF Number of Neighbors >= ASSOCIATION_NEIGHBORS Association Ratio += NUM_NEIGHBORS_WEIGHT ELSE Association Ratio += NUM_NEIGHBORS_WEIGHT * (Number of Neighbors / ASSOCIATION_NEIGHBORS) Association Ratio += LQI_CLASS_WEIGHT * (Min LQI Class / 3) where ASSOCIATION_NEIGHBORS = 5

Freshness Use: The Freshness value is used when the table is full and a new entry is added. The entry with the smallest Freshness value is replaced with the new entry. If more than one entry has a value of zero, anyone can be replaced. This case only occurs if the table size is greater than 255 entries.

Every time a mesh frame is forwarded, no matter the routing method used, at the exception of the Keep Alive Initiate, the forwarding Node creates a temporary route entry to the originator in Temporary Route Take. This allows the destination Node to quickly send a reply, even if it didn't previously know the route to the originator Node. This route expires after TEMP_ROUTE_TO.

TABLE 67a Temporary Route Table Field Name Data type Description Temporary array[MAX_NUM_TEMP_ROUTES] Table of Route Table of Temp Route Entry temporary routes record from frames received.

TABLE 67b Temporary Route Entry Field Name Data type Description Target Binary MAC address of target Node Address 2 octets Next Hop Binary MAC address of the Node used to route Address 2 octets the frame to the target Node Lifetime Binary Countdown in second initialized to 1 octet TEMP_ROUTE_TO when the entry is created. Set to zero when the entry does not contain valid information.

The End Device Table is used to maintain information about each End Device Child.

TABLE 68a End Device Table Field Name Data type Description End Device array[MAX_NUM_END_DEVICES] Table of End Table of End Device Entry Devices associated with a Router

TABLE 68b End Device Entry Field Name Data type Description Long Address Binary, EUI address of the End Device 8 octets Short Address Binary, Assigned address of End Device 2 octets (unassigned = 0x0000) Communication Binary, The UTC time at which the End Age 1 octet Device was last communicated with. The units are in 16 minutes increments of time. RX Source DLL Unsigned, The last authenticated DLL full Nonce Count 5 octets nonce count received from this End Device.

Security events are provided to the upper layers for diagnostic and auditing purposes. The content of each event is described bellow.

TABLE 69 Security Events Field Name Data type Description Security Unsigned Control flags for fields present in the log Event Log Integer, Bit 7 = 1: UTC time present Bit 6 = 1: Control 1 octet MAC source long otherwise the source PAN and short address is present Bit 5 = 1: Short address of Network originator present Bit 4 = 1: Service Code present Bits 3-1 = 1: key type: 11x = Reserved 101 = Node Key-1 100 = Node Key-0 011 = Mesh Key-1 010 = Mesh Key-0 001 = Maintenance Key-1 000 = Maintenance Key-0 Bit 0 Reserved (=0) UTC Time Unsigned The UTC time is recorded for events by Of Event Integer, those devices supporting a UTC clock. 4 octets, 1 minute units MAC Binary, Records the MAC source address of the Source 8 octets logged event message. This address is Address either the long address or the MAC source PAN and short address padded with 0″s in the MSB. Network Binary, The Network Originator PAN and Address Originator 4 octets (optional - used only for messages with Address network addresses. Service Binary, Full Service Type octet from the event Type 1 octet message. Service Binary, Service Code octet from the event message Code 1 octet if present.

The Source Route table is used to maintain source routes established by the Route Discovery process with the Trace Route flag bit set and through the Route Establishment process.

TABLE 70a Source Route Table Field Name Data type Description Source array[MAX_NUM_SOURCE_ROUTES] List if source Route of Source Route Table Entry routes Table

TABLE 70b Source Route Table Entry Field Name Data type Description Target Binary MAC address of target Node Address 2 octets Number Bits 7-6 Defines the number of entries in the PAN of PAN identifiers field. identifiers Number Bits 3-0 Number of Addresses in Hop Addresses of Hops list. Source routing is used when the Addresses Target device is more than one hop away. Therefore the Number of hops is at least one. PAN Array of List of Network identifiers. Bits 15-14 Identifiers Binary of the different short addresses specified 2 octets within this frame reference this list. Each short address is explicitly associated with one of the three specified PAN Iden- tifiers, or none of them. Hop Array of Short address of each Node responsible Addresses Binary for routing this message. Bits 15-14 2 octets define network membership of the Node as described by the PAN identifiers field. Entry Valid Bit 0 Set if the entry contain valid information Freshness Bits 3 to 7 Decremented each time the table is parsed for another entry. Reset to 0x1F (31) each time the entry is used.

Finally, the SMIB table of parameters is set forth below.

TABLE 71 SM Information Base (SMIB) Table ID Parameter name Type/units Range Description 1 ADDRESS_TX_ORDER 0 or 1 Order of transmission of the MAC and Mesh level addresses. The standard transmission order specified by IEEE 802.15.4 is Least Significant Octet First. 0 = Least Significant Octet First 1 = Most Significant Octet First 2 ASSOCIATION_EVAL_MIN_IMPROVEMENT unsigned  1-255 To avoid nodes bouncing back and forth between integer % gates at each re-evaluation, a “hysteresis” factor shall be implemented; association to a new gate (if already associated) shall only occur if the new network offers an association ratio that is equal or greater than [current association ratio × (1 + ASSOCIATION_EVAL_MIN_IMPROVEMENT)] 3 ASSOCIATION_NEIGHBORS Unsigned  1-255 Maximum number of neighbors used in Association Integer Ratio algorithm 4 ASSOCIATION_EVAL_PERIOD Unsigned  1-255 The spec says that the node shall periodically integer (8 evaluate if “better” networks are bits) 1 day visible. A parameter shall dictate how frequent this evaluation shall take place. 5 ASSOCIATION_RESP_TIMEOUT Integer 100-25500 ms Response timeout for the Association Request 100 ms message 6 CHECKPOINT_MAX_ATTEMPTS Unsigned  1-255 Maximum number of Checkpoint process initiated Integer without receiving a valid Keep Alive Response is allowed before initiating the Association process. 7 CHECKPOINT_PERIOD Unsigned 1-255 min Period at which a Node initiate a mandatory Integer communication with the Coordinator. This 1 min communication always starts by the transmission of a Keep Alive Request and reception of a Keep Alive Response and is optionally follows by exchanges of application level messages. 8 COORD_LOAD_WEIGHT Unsigned 0-1 Weight for Coordinator load used in Association Integer Ratio algorithm 0.01 9 COORD_RESPONSE_TIMEOUT Unsigned 100 to 25500 ms Timeout when waiting for a response from the Coordinator Integer 0.1 sec 10 DATA_REQUEST_TIMEOUT Integer 10-2500 ms Timeout used by End Devices when waiting for a 10 ms response to the End Device Data Request 11 END_DEVICE_INACTIVE_TO Integer 1-255 sec Inactivity timeout used by Sleeping End Devices 1 sec waiting for the initiation of a local communica- tion 12 END_DEVICE_PERIOD Integer 1-255 sec Notification period used by Sleeping End Devices 1 sec when it is in local communication mode 13 END_DEVICE_WAIT Integer 10-2550 ms Timeout used by Sleeping End Devices when waiting 10 ms for an incoming frame after an End Device Node Present frame 14 HOP_NUM_WEIGHT Unsigned 0-1 Weight for Number of hops to the Coordinator Integer used in Association Ratio algorithm 0.01 15 LOCAL_COM_TO Integer 100-25500 ms Inactivity timeout used by Sleeping End Devices 100 ms in local communications mode 16 LQI_CLASS_WEIGHT Unsigned 0-1 Weight for minimum LQI class used in Association Integer Ratio algorithm 0.01 17 MAX_HOPS Unsigned 15 Maximum number of hops allowed on the mesh network Integer 18 MAX_NUM_END_DEVICES Unsigned  1-255 Maximum number of entries in the End Device Table Integer 19 MAX_NUM_END_NODES Unsigned  1-255 Max number of entries in the End Device Table Integer 21 MAX_NUM_NEIGHBORS Unsigned  1-255 Maximum number of neighbors recorded in the Integer Neighborhood Table 22 MAX_NUM_STATIC_ROUTES Unsigned  1-255 Maximum number of entries in the Route Table Integer 23 MAX_NUM_TEMP_ROUTES Unsigned  1-255 Maximum number of entries in the Temporary Route Integer Table 24 MAX_TREE_REPAIR Unsigned 0-5 Maximum number of time a Router using tree routing Integer retry to transmit a frame to a different Parent Node or Sibling Node. 25 MESSAGE_RESPONSE_TO Unsigned 1-255 sec Timeout for a request message to receive a response. Integer Used to release the Network Security Header count 1 sec stored until the response is received. 26 NEIGHBOR_EX_RND_PERIOD Integer 1-255 sec A random delay is required before responding to a Neighbors Exchange message with the Immediate Broadcast Requested parameter set. This period represent the maximum value allowed for this random delay. 27 NEIGHBOR_EXCHANGE_PERIOD Integer min 1-255 min Delay between each Neighbors Exchange 28 NEIGHBOR_INFO_RESP_TIME Integer 10-2550 ms Period used to spray Neighbor Info Response 10 ms messages 29 NUM_NEIGHBORS_WEIGHT Unsigned 0-1 Weight for the number of neighbors used in Integer Association Ratio algorithm 0.01 30 OVERLAPPING_DEPTH 0 or 1 0-1 Penetration of network trees within neighbor networks. 0 = Single hop 1 = Up to MAX_HOPS 31 PO_AGGREGATION_PERIOD Integer 1-255 sec Initial period used just after a power outage 1 sec or power restoration to allows aggregation of leaf Nodes event by their Parents and the reporting of the first hop Nodes. 32 PO_RECOGNITION_PERIOD Integer 1-25.5 sec Minimum of a power outage before sending a reel 0.1 sec time power outage event report 33 PO_RETRY_RND_PERIOD Integer 1-255 sec Period used stray communication of Nodes 1 sec reporting a power outage during retries 34 PO_RND_PERIOD Integer 10-2550 sec Period used stray communication of Nodes 10 sec reporting a power outage during their first attempt 35 POWER_REPORT_WAIT Integer 1-255 sec Time allows for a Node to send is power event 1 sec using tree routing. After this period, the Node try to use mesh routing to send its event 36 POWER_RESTORATION_ASSOC Integer 1 to 255 min Maximum time allows after a power restoration to min successfully send a power restoration event to the Coordinator. Nodes unable to send it event within this timeout initiating an Association process. 37 PR_RETRY_RND_PERIOD Integer 1-255 sec Period used stray communication of Nodes reporting 1 sec a power restoration event during retries 38 PR_RND_PERIOD Integer 10-2550 sec Period used stray communication of Nodes reporting 10 sec a power restoration event during their first attempt 39 FRR_TEST_RETRY Integer 1 to 12 Number of time a Frame Reception Rate Test Init, Frame Reception Rate Test End and Frame Reception Rate Test Result are retransmitted in the case of a MAC layer transmission failure. 40 RESP_SLEEP_PERIOD Integer 1-255 sec End device sleep period when it is expecting a 1 sec response. 41 RESTORATION_TIMEOUT Integer 1-255 min Maximum time allowed for reporting a power restora- min tion notification event and receives an acknowledg- ment. 42 ROUTE_LOST_ATTEMPTS Integer  1-255 The number of consecutive times an End Device tries to send a frame through its Parent before changing Parent. 43 RREQ_RX_TIME Integer 1-255 ms The time the target of a Route Request waits to 1 ms collect route data from other paths before responding. 44 RREQ_TO Integer 10-2550 ms Timeout when waiting for a Route Request after 10 ms broadcasting a Route Request 45 SERVICE_PERIOD Unsigned 0-255 sec Period used to limits the rate at which frames can be sent Integer using the Forwarding Service Messages process. 1 sec 46 SERVICE_TO Unsigned 0-255 sec Timeout that determines how long the Router and Integer the Coordinator keep an inactive forwarding 1 sec processes open 47 SLEEP_CHECK_PERIOD Unsigned 1-255 sec Period at which Sleeping End Devices wakeup to Integer check if there is a frame buffered in its Parent 1 sec 48 TEMP_ROUTE_TO Integer 10-2550 sec The time a temporary route is retained 10 sec 49 MAX_ASSOCIATIONS Unsigned  1-15 The number of Coordinators a device can associate Default 3 with. Integer Among other things this set the number of Mesh Key entries needed for storage. 50 MAX_MF_WAIT_PERIOD Integer 1-255 ms Timeout receiving a buffered message following 1 ms default an End Device Data Request ACK with the Frame 20 ms Pending bit set. 51 PING_TO Integer 1-255 s Ping time out from Ping request to Ping response. 1 s 52 LQI_HIGH_FACTOR Float 0.00-1.00 The factor used to update the “LQI rx” number when LQI > LQI rx in Table 2 53 LQI_LOW_FACTOR Float 0.00-1.00 The factor used to update the “LQI rx” number when LQI rx > LQI in Table 2 54 LQI_MISSED_EX_FACTOR Float 0.00-1.00 The factor used to update the “LQI rx” number in Table 2 when the Neighbor Exchange message is missed twice. 55 MAX_NUM_SOURCE_ROUTES Unsigned  1-255 Maximum number of entries in the Source Route Integer Table 56 LQI_CLASS1_HIGH_THRESHOLD Unsigned  0-255 LQI threshold for class 1. Node with LQI between Integer 0 and LQI_CLASS1_HIGH_THRESHOLD are categorized in class 1. 57 LQI_CLASS2_HIGH_THRESHOLD Unsigned  0-255 LQI threshold for class 2. Node with LQI between Integer LQI_CLASS1_HIGH_THRESHOLD + 1 and LQI_CLASS1_HIGH_THRESHOLD] are categorized in class 2. 

1. A method of associating a device to a mesh network, comprising: selecting a network for association including: requesting, by the device, neighbor information from neighboring devices which may belong to one or more networks, receiving, at the device from one or more neighboring devices, neighbor information for each of the one or more neighboring devices, applying an association ratio algorithm to the received neighbor information to determine which of the one or more networks to select for association; selecting a router within the selected network through which to proxy messages by applying a preferred route ratio algorithm; sending a network association request from the device through the router to a network coordinator; at the network coordinator, performing one of the following in response to the network association request: validating the association request with an association response message which includes a short address for the device, not responding to the network association request; and constructing, at the device, an initial neighborhood table.
 2. A process for routing data frames from a first node to a second node within a network, the process including: a tree routing sub-process, a source routing sub-process, a temporary routing sub-process and a mesh routing sub-process, wherein the particular sub-process for routing a data frame from the first node the second nodes is selected in accordance with the following logic executed on a processor; if the data frame has a source route header the source routing sub-process is selected; if there is an entry for the target address in a temporary routing table, the temporary muting sub-process is selected; if the second node is a coordinator node, the tree routing sub-process is selected; if the second node is not a coordinator node, the mesh routing sub-process is selected.
 3. The process according to claim 2, wherein the tree routing sub-process comprises: accessing by the first node a neighborhood table to determine a route to the coordinator; selecting by the first node a neighbor with a preferred parent flag; transmitting the data frame to a first parent neighbor with the preferred parent flag; if transmission to the first parent neighbor does not succeed, selecting a next parent neighbor from the neighborhood table with a hop-count value less then the hop-count value of the first node until the transmission succeeds; if transmission does not succeed via a neighbor having a hop-count value less then the hop-count value of the first node, selecting a sibling neighbor from the neighborhood table for transmission to the second node, wherein a sibling neighbor has a hop-count value that is equal to the hop-count value of the first node.
 4. The process according to claim 3, wherein the tree routing sub-process further comprises within the step of selecting a next parent neighbor from the neighborhood table with a hop-count value less than the hop-count value of the first node until the transmission succeeds: ordering next parent neighbors according to a preferred route ratio value as follows: Preferred Route Ratio=Min LQI class<<12|(15−Number of Hops)<<8|Avg LQI where Min LQI class is the minimum of all LQI class for each hop between the first node and the coordinator node through this next parent neighbor, and Avg LQI is the average of the LQI value of each hop between the first node and the coordinator node through this next parent neighbor; for all the possible routes with the best min LQI class, selecting the next parent neighbors with the least number of hops; and select the next parent neighbor with the best Avg LQI.
 5. The process according to claim 2, wherein the source muting sub-process comprises: following a known route from the first node to the second node, the known route being embedded in a header of the data frame in the form of a list of node addresses located along the known route from the first node to the second node, wherein each node located along a route path from the first node to the second node forwards the data frame to the next node address located on the list after the current node's address; wherein the known route to the second node is determined by (i) sending by the first node a route request frame to the second node with a trace route flag set or (ii) sending by the first node a route establishment request frame to the coordinator requesting a route to the second node.
 6. The process according to claim 2, wherein the mesh routing sub-process comprises: accessing a first route table at the first node to determine a route for the second node based on the second node address; sending the data frame from the first node to an interim node in the route using the interim node address from the route; accessing a second route table at the interim node to determine a second interim node address from the route based on the second node address; sending the data frame from the interim node to a second interim node address; if the interim node is unable to send the data frame to the second interim node address, broadcasting a route error message and deleting a second interim node address; and receiving an error message at the first node if the data frame does not reach the second node.
 7. A process for discovering a route from a first node to a second node in a mesh network comprising: broadcasting by the first node a route request message that is propagated across multiple nodes within the mesh network in accordance with the following process implemented within processors at the multiple nodes: accepting a route request at a receiving node if: (i) no previous received route request message had the same request ID; and (ii) the route request message is received through a link with a minimum LQI class at least equal to the requested one; identifying the receiving node as a route candidate and (iii) if the route request message is accepted by an intermediate node, re-broadcasting the route request; (iv) if the route request message is accepted by the second node, sending a route reply message from the second node through the identified route candidate back to the first node to establish a static bidirectional route within the mesh network between the first node and the second node.
 8. A process for upgrading a route from a first node to a second node in a mesh network further comprising: accepting a route request at a receiving node for upgrading the route if; a route candidate already exists for the request ID; the request was received through a link with a minimum LQI class at least equal to the requested one; and the request was received through a better link than the prior received one, as determined by one of the following sets of conditions: (i) the receiving node is a neighbor, the route request is received from a neighbor and a resulting route length is shorter; (ii) the receiving node is not a neighbor, the route request is received from a neighbor and a resulting route length is shorter or equal to existing route length; (iii) the receiving node is not a neighbor, the route request is received from a non-neighbor and a resulting route length is shorter; otherwise rejecting the route request.
 9. A process for requesting a route from a first node to a second node within a mesh network comprising: transmitting a route request message to a pre-determined coordinator node, wherein the route request message includes a long address for the second node; constructing at the coordinator node a route through one or more routing nodes from the first node to the second node; transmitting a response to the route request message to the first node including the route to the second node, wherein the route includes an assigned short address for the second node.
 10. The process according to claim 9, wherein the long address is 8 octets and the short address is 2 octets.
 11. A data structure for securing data frames transmitted in a single hop within a mesh network from a first node to a second node, the data structure comprising: a data link layer (DLL) security header located after a service-type octet when a predetermined security header flag is selected within the service-type octet, the DLL security header including: a first set of bits containing a portion of a transmitted nonce count; a bit following the first set of bits containing a key identifier (ID), wherein the key ID selects a current version of a key used for calculating a message integrity check (MIC); and a second set of bits containing the MIC.
 12. The data structure according to claim 11, wherein a DLL nonce used in the MIC calculation includes: a thirteen octet nonce composed of the full DLL nonce count and the MAC layer source address, wherein the Full DLL Nonce Count is five octets long as the MAC layer source address is selected from the group consisting of (i) an 8-octet long extended unique identifier (EUI) address, and (ii) a 2-octet source PAN ID and a 2-octet short address prefixed by four octets of all ones.
 13. A process for validating integrity of message data transmitted in a single hop from a first node to a second node within a mesh network, the process comprising: checking at a processor of the second node the 23 least significant bits (0-22) of a count transmitted from the first node against a last authenticated count; if the transmitted count value is greater than the last authenticated count, combining at a processor of the second node, the 23 least significant bits (0-22) with the 17 most significant bits (23-39) of the last authenticated count to form a revised count; if the transmitted count value is lower than the last authenticated count, incrementing the value of bits 23 through 29 by one before combining at a processor of the second node, the 23 least significant bits (0-22) with the 17 most significant bits (23-39) of the last authenticated count to form a revised count; calculating at the processor of the second node a message integrity check (MIC) value using the revised count and pre-selected key; if the calculated MIC value equals a received MIC value, then the message data integrity is validated.
 14. A data structure for securing data frames transmitted in multiple hops using multiple nodes across a mesh network, the data structure comprising: a network security header located after a data link layer (DLL) security layer within a mesh header, the network security header including: a first set of bits containing a network count; a bit following the first set of bits containing a network key identifier (ID); and a second set of bits containing a network message integrity check (MIC).
 15. The data structure according to claim 14, wherein a network security nonce for MIC calculation is thirteen octets and when the data frame is a request includes a network count, an originator PAN ID and an address padded with zeros and when the message is a response includes the network count, target PAN ID, target address, originator PAN ID and originator address.
 16. A process for validating integrity of a data frame transmitted in multiple hops using multiple nodes across a mesh network, the process comprising: receiving a data frame at a receiver node, wherein the data frame includes a network security header including a network count, a network key identifier (ID) and a message integrity check (MIC); processing an identifier (ID) for an originating node that originated the data frame and a source field address to determine if the data frame was received from a coordinator node or a non-coordinator node; if the data frame was received from a coordinator node, the network key ID selects a node key for determining verification; if the data frame was received from a non-coordinator node, the network key ID selects a mesh key for determining verification; when the received data frame is a request, a nonce is a combination of at least the network count, the originating node ID and an originating node address and the receiving node verifies the integrity of the frame by: adding a 0 to the network field to make a 40 bit field, calculating the received MIC using either the node key or the mesh key as identified by the network key ID; comparing the transmitted MIC with the received MIC, wherein the data frame is verified if the transmitted MIC is equal to the received MIC; when the received data frame is a response, the network count is combined with the identifier and address for the target of the data frame and the originating node ID and an originating node address and the receiving node compares a network count in the response with a network count in the request, wherein the data frame is verified if the response network count is equal to the request network count. 